665 search results - page 62 / 133 » Algorithms for Triangulated Terrains |
120
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
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 ...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic ...
FLAIRS
2006
14 years 11 months ago
2006
This paper presents three new algorithms for the automatic construction of models from Object Oriented Probabilistic RelationalModels. The first two algorithms are based on the kn...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
CCCG
2008
14 years 11 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...