Sciweavers

20 search results - page 2 / 4
» Jacobi Curves: Computing the Exact Topology of Arrangements ...
Sort
View
COMPGEOM
2005
ACM
13 years 6 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
SODA
2008
ACM
106views Algorithms» more  SODA 2008»
13 years 6 months ago
Exact and efficient 2D-arrangements of arbitrary algebraic curves
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
Arno Eigenwillig, Michael Kerber
15
Voted
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 5 months ago
On the Computation of the Topology of a Non-Reduced Implicit Space Curve
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise ...
Daouda Niang Diatta, Bernard Mourrain, Olivier Rua...
CORR
2011
Springer
206views Education» more  CORR 2011»
12 years 12 months ago
Arrangement Computation for Planar Algebraic Curves
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...
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,...