Sciweavers

50 search results - page 6 / 10
» On the topology of planar algebraic curves
Sort
View
SMA
2010
ACM
164views Solid Modeling» more  SMA 2010»
14 years 9 months ago
Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests
We present an algorithm which robustly computes the intersection curve(s) of an under-constrained piecewise polynomial system consisting of n equations with n + 1 unknowns. The so...
Michael Barton, Gershon Elber, Iddo Hanniel
CAD
2008
Springer
14 years 9 months ago
Self-intersection detection and elimination in freeform curves and surfaces
We present several algorithms for self-intersection detection, and possible elimination, in freeform planar curves and surfaces. Both local and global self-intersections are elimi...
Diana Pekerman, Gershon Elber, Myung-Soo Kim
COMPGEOM
2001
ACM
15 years 1 months ago
The convex hull of ellipsoids
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
PG
2007
IEEE
15 years 3 months ago
A Subdivision Arrangement Algorithm for Semi-Algebraic Curves: An Overview
We overview a new method for computing the arrangement of semi-algebraic curves. A subdivision approach is used to compute the topology of the algebraic objects and to segment the...
Julien Wintz, Bernard Mourrain
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 9 months ago
On Graph Crossing Number and Edge Planarization
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
Julia Chuzhoy, Yury Makarychev, Anastasios Sidirop...