Sciweavers

3005 search results - page 127 / 601
» Computational geometry for sculpture
Sort
View
COMPGEOM
1994
ACM
15 years 10 months ago
Computing Many Faces in Arrangements of Lines and Segments
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
Pankaj K. Agarwal, Jirí Matousek, Otfried S...
COMPGEOM
2000
ACM
15 years 11 months ago
Pitfalls in computing with pseudorandom determinants
It has been known for 30 years that pseudorandom number generators in the class of linear congruential generators (LCG) exhibit strong and predictable regularities. A widely used ...
Bernd Gärtner
COMPGEOM
1999
ACM
15 years 11 months ago
H-Walk: Hierarchical Distance Computation for Moving Convex Bodies
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical ...
Leonidas J. Guibas, David Hsu, Li Zhang
COMPGEOM
1989
ACM
15 years 10 months ago
Computing the Irreducible Real Factors and Components of an Algebraic Curve
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...
Erich Kaltofen
COMPGEOM
2007
ACM
15 years 10 months ago
Computing the exact arrangement of circles on a sphere, with applications in structural biology: video
The Bentley-Ottmann (BO) algorithm, initially designed to report the intersection points of line-segments in the plane, is the prototypical sweep-line algorithm. This video presen...
Frédéric Cazals, Sébastien Lo...