36 search results - page 3 / 8 » Topology and arrangement computation of semi-algebraic plana... |
62
Voted
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
105
click to vote
COMPGEOM
2001
ACM
15 years 3 months ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
83
Voted
CAGD
2010
14 years 11 months ago
2010
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the p...
86
Voted
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...