Sciweavers

92 search results - page 16 / 19
» The Number of Triangulations on Planar Point Sets
Sort
View
GIS
2008
ACM
14 years 9 months ago
Efficient data modeling and querying system for multi-dimensional spatial data
Multi-dimensional spatial data are obtained when a number of data acquisition devices are deployed at different locations to measure a certain set of attributes of the study subje...
Wei Li, Cindy X. Chen
SMA
2003
ACM
132views Solid Modeling» more  SMA 2003»
14 years 1 months ago
Tight cocone: a water-tight surface reconstructor
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
Tamal K. Dey, Samrat Goswami
CCCG
2010
13 years 10 months ago
I/O-efficient triangular range search and its application
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...
Gautam K. Das, Bradford G. Nickerson
ICDCS
2008
IEEE
14 years 3 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
ICCV
1995
IEEE
14 years 3 days ago
Locating Objects Using the Hausdorff Distance
The Hausdorff distance is a measure defined between two point sets, here representing a model and an image. The Hausdorff distance is reliable even when the image contains multipl...
William Rucklidge