Calculating approximate curve arrangements using rounded arithmetic

Authors:
V. Milenkovic
Affiliations:
Harvard University
Venue:
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Year:
1989

Citing 13
Cited 9

Cylindrical algebraic decomposition I: the basic algorithm

SIAM Journal on Computing
Cylindrical algebraic decomposition II: an adjacency algorithm for the plane

SIAM Journal on Computing
Numerical stability of geometric algorithms

SCG '87 Proceedings of the third annual symposium on Computational geometry
Partitioning Polyhedral Objects into Nonintersecting Parts

IEEE Computer Graphics and Applications
Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets

Journal of Symbolic Computation
An adjacency algorithm for cylindrical algebraic decompositions of three-dimenslonal space

Journal of Symbolic Computation
Verifiable implementation of geometric algorithms using finite precision arithmetic

Artificial Intelligence - Special issue on geometric reasoning
Towards implementing robust geometric computations

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A geometric consistency theorem for a symbolic perturbation scheme

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Epsilon geometry: building robust algorithms from imprecise computations

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On the representation and manipulation of rigid solids

On the representation and manipulation of rigid solids
Consistent calculations for solids modeling

SCG '85 Proceedings of the first annual symposium on Computational geometry
Robust Set Operations on Polyhedral Solids

Robust Set Operations on Polyhedral Solids

Using tolerances to guarantee valid polyhedral modeling results

SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Constructing strongly convex hulls using exact or rounded arithmetic

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficient Delaunay triangulation using rational arithmetic

ACM Transactions on Graphics (TOG)
Parallel robust algorithms for constructing strongly convex hulls

Proceedings of the twelfth annual symposium on Computational geometry
On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time

Proceedings of the twelfth annual symposium on Computational geometry
Simple and practical geometric algorithms

ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Approximate data structures with applications

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Robust algorithms for constructing strongly convex hulls in parallel

Theoretical Computer Science
Topology and arrangement computation of semi-algebraic planar curves

Computer Aided Geometric Design

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present here an algorithm for the curve arrangement problem: determine how a set of planar curves subdivides the plane. This algorithm uses rounded arithmetic and generates an approximate result. It can be applied to a broad class of planar curves, and it is based on a new definition of approximate curve arrangements. This result is an important step towards the creation of practical computer programs for reasoning about algebraic curves of high degree.