205 search results - page 13 / 41 » On Deletion in Delaunay Triangulations |
181
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
150
Voted
PERCOM
2009
ACM
16 years 27 days ago
2009
ACM
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
175
click to vote
NOSSDAV
2009
Springer
16 years 19 days ago
2009
Springer
This article proposes a new distributed architecture for update message exchange in massively multi-user virtual environments (MMVE). MMVE applications require delivery of updates...
149
Voted
ICDCS
2007
IEEE
16 years 12 days ago
2007
IEEE
Delaunay triangulation (DT) is a useful geometric structure for networking applications. In this paper we investigate the design of join, leave, and maintenance protocols to const...
142
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...