4850 search results - page 650 / 970 » Proof and Computation in Geometry |
164
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
162
click to vote
SIGGRAPH
1997
ACM
15 years 11 months ago
1997
ACM
Interactively manipulating the geometry of complex, globally illuminated scenes has to date proven an elusive goal. Previous attempts have failed to provide interactive updates of...
199
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
193
click to vote
COMPGEOM
1987
ACM
15 years 10 months ago
1987
ACM
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point cont...
212
click to vote
CAD
2008
Springer
15 years 7 months ago
2008
Springer
Conventional shape matching for engineering models primarily considers rigid shape similarity. They do not seek global shape similarity while considering large local deformations....