Sciweavers

160 search results - page 24 / 32
» Focal surfaces of discrete geometry
Sort
View
COMPGEOM
2009
ACM
14 years 2 months ago
Straight skeletons of three-dimensional polyhedra
This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis...
Gill Barequet, Amir Vaxman
COMPGEOM
1998
ACM
13 years 11 months ago
Constructing Approximate Shortest Path Maps in Three Dimensions
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
Sariel Har-Peled
COMPGEOM
2001
ACM
13 years 11 months ago
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
Shankar Krishnan, Mark Foskey, Tim Culver, John Ke...
COMPGEOM
2011
ACM
12 years 11 months ago
A generic algebraic kernel for non-linear geometric applications
We report on a generic uni- and bivariate algebraic kernel that is publicly available with Cgal 3.7. It comprises complete, correct, though efficient state-of-the-art implementati...
Eric Berberich, Michael Hemmer, Michael Kerber
SIGGRAPH
1994
ACM
13 years 11 months ago
A framework for the analysis of error in global illumination algorithms
In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the bou...
James Arvo, Kenneth E. Torrance, Brian E. Smits