665 search results - page 28 / 133 » Algorithms for Triangulated Terrains |
119
click to vote
DAM
1998
15 years 3 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
111
Voted
WADS
2007
Springer
15 years 10 months ago
2007
Springer
75
Voted
ISAAC
1998
Springer
15 years 8 months ago
1998
Springer
122
Voted
IMR
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents a simple technique for generating anisotropic surface triangulations using a generic unstructured quadrilateral decomposition of CAD entities that map to a log...
138
click to vote
CCCG
2007
15 years 5 months ago
2007
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...