126 search results - page 4 / 26 » Self-improving algorithms for delaunay triangulations |
COMPGEOM
2000
ACM
15 years 1 months ago
2000
ACM
WADS
2007
Springer
15 years 3 months ago
2007
Springer
101
click to vote
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
169
click to vote
APDC
1997
14 years 11 months ago
1997
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
89
Voted
ISAAC
1999
Springer
15 years 1 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...