Sciweavers

3025 search results - page 597 / 605
» Computational geometry: a retrospective
Sort
View
GIS
2003
ACM
14 years 3 months ago
Construction of the planar partition postal code map based on cadastral reGIStration
Accurate postal code maps have many applications within GIS as the postal code has the potential to link the address description of buildings to their location in a specified glob...
Friso Penninga, Edward Verbree, Wilko Quak, Peter ...
COMPGEOM
2010
ACM
14 years 2 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
COMPGEOM
2010
ACM
14 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
VRST
1999
ACM
14 years 2 months ago
Fast calibration for augmented reality
Augmented Reality overlays computer generated images over the real world. To correctly depict spatial relations between real and virtual objects, these images have to be generated...
Anton L. Fuhrmann, Dieter Schmalstieg, Werner Purg...
VLDB
1998
ACM
127views Database» more  VLDB 1998»
14 years 2 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...