Sciweavers

995 search results - page 81 / 199
» Constructive Volume Geometry
Sort
View
ESA
2004
Springer
117views Algorithms» more  ESA 2004»
14 years 1 months ago
Classroom Examples of Robustness Problems in Geometric Computations
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan ...
COMPGEOM
1994
ACM
14 years 4 days ago
Query-Sensitive Ray Shooting
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
Joseph S. B. Mitchell, David M. Mount, Subhash Sur...
GRAPHICSINTERFACE
2007
13 years 9 months ago
Constrained planar remeshing for architecture
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
Barbara Cutler, Emily Whiting
FOCS
2008
IEEE
14 years 2 months ago
Spherical Cubes and Rounding in High Dimensions
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...
Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigders...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle