665 search results - page 32 / 133 » Algorithms for Triangulated Terrains |
100
click to vote
IJCGA
2002
15 years 16 days ago
2002
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
100
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Positioning multiple sensors for acquisition of a a given environment is one of the fundamental research areas in various fields, such as military scouting, computer vision and ro...
141
Voted
DCG
2008
15 years 25 days ago
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
110
Voted
AAAI
2011
14 years 23 days ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
94
Voted
COMGEO
1999
ACM
15 years 13 days ago
1999
ACM
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...