Sciweavers

Share
26 search results - page 1 / 6
» The Employment of Regular Triangulation for Constrained Dela...
Sort
View
ICCSA
2004
Springer
10 years 9 months ago
The Employment of Regular Triangulation for Constrained Delaunay Triangulation
Abstract. We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constraine...
Pavel Maur, Ivana Kolingerová
DCG
2008
118views more  DCG 2008»
10 years 4 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk
COMPGEOM
2003
ACM
10 years 9 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
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...
Jonathan Richard Shewchuk
SODA
2001
ACM
126views Algorithms» more  SODA 2001»
10 years 5 months ago
Static and kinetic geometric spanners with applications
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
Menelaos I. Karavelas, Leonidas J. Guibas
ISAAC
1999
Springer
110views Algorithms» more  ISAAC 1999»
10 years 8 months ago
Online Routing in Triangulations
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...
Prosenjit Bose, Pat Morin
books