Sciweavers

77 search results - page 1 / 16
» Complete, exact, and efficient computations with cubic curve...
Sort
View
COMPGEOM
2004
ACM
13 years 8 months ago
Complete, exact, and efficient computations with cubic curves
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
Arno Eigenwillig, Lutz Kettner, Elmar Schömer...
COMGEO
2006
ACM
13 years 4 months ago
Exact, efficient, and complete arrangement computation for cubic curves
Arno Eigenwillig, Lutz Kettner, Elmar Schömer...
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
13 years 8 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...
SMA
2008
ACM
149views Solid Modeling» more  SMA 2008»
13 years 4 months ago
Exact arrangements on tori and Dupin cyclides
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
Eric Berberich, Michael Kerber
CAD
2008
Springer
13 years 5 months ago
Approximate computation of curves on B-spline surfaces
Curves on surfaces play an important role in computer-aided geometric design. Because of the considerably high degree of exact curves on surfaces, approximation algorithms are pre...
Yi-Jun Yang, Song Cao, Jun-Hai Yong, Hui Zhang, Je...