7 search results - page 1 / 2 » Minimum Weight Triangulation by Cutting Out Triangles |
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
CCCG
2007
13 years 6 months ago
2007
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
SODA
1992
ACM
13 years 6 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
IJCGA
2008
13 years 4 months ago
2008
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
VISUALIZATION
1995
IEEE
13 years 8 months ago
1995
IEEE
We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greed...