665 search results - page 69 / 133 » Algorithms for Triangulated Terrains |
138
Voted
SIBGRAPI
1999
IEEE
15 years 8 months ago
1999
IEEE
Abstract. This paper describes an algorithm for generating unstructured triangulations for arbitrarily shaped twodimensional regions. The algorithm works for regions without cracks...
119
Voted
SGP
2007
15 years 6 months ago
2007
We present a streaming algorithm for reconstructing closed surfaces from large non-uniform point sets based on a geometric convection technique. Assuming that the sample points ar...
136
Voted
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
158
click to vote
CAD
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
156
click to vote
GD
2003
Springer
15 years 9 months ago
2003
Springer
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...