Sciweavers

5 search results - page 1 / 1
» On Vertical Decomposition of Arrangements of Hyperplanes in ...
Sort
View
COMPGEOM
1991
ACM
13 years 8 months ago
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
David Avis, Komei Fukuda
COMPGEOM
1995
ACM
13 years 8 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
CGF
2002
135views more  CGF 2002»
13 years 4 months ago
Slow Growing Subdivision (SGS) in Any Dimension: Towards Removing the Curse of Dimensionality
In recent years subdivision methods have been one of the most successful techniques applied to the multi-resolution representation and visualization of surface meshes. Extension t...
Valerio Pascucci
COMPGEOM
2003
ACM
13 years 9 months ago
Curve-sensitive cuttings
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
Vladlen Koltun, Micha Sharir