High-Level Filtering for Arrangements of Conic Arcs

No abstract is available for this paper.

• Publication year

  2002

• Venue

  Embedded Systems and Applications

• Publication date

  2002-09-17

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-45749-6_76
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Arrangements

  2004cited by this paper
• Hybrid Motion Planning: Coordinating Two Discs Moving among Polygonal Obstacles in the Plane

  2002cited by this paper
• Computing the Detour of Polygonal Curves

  2002cited by this paper
• A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons

  2002cited by this paper
• Robust Geometric Computing in Motion

  2002cited by this paper
• A new constructive root bound for algebraic expressions

  2001cited by this paper
• Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!

  2001cited by this paper
• Introduction to Numerical Analysis

  2001cited by this paper
• PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation

  2001cited by this paper
• Look — a Lazy Object-Oriented Kernel for geometric computation

  2000cited by this paper
• Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves

  2000cited by this paper
• Algebraic methods and arithmetic filtering for exact predicates on circle arcs

  2000cited by this paper
• Handbook of computational geometry

  2000cited by this paper
• Closest-Point Problems in Computational Geometry

  2000cited by this paper
• Robustness and Precision Issues in Geometric Computation

  2000cited by this paper
• Polygon decomposition for efficient construction of Minkowski sums

  2000cited by this paper
• Offsets, sweeps, and Minkowski sums

  1999cited by this paper
• Eric Weisstein''s World of Mathematics

  1999cited by this paper
• On-Line Zone Construction in Arrangements of Lines in the Plane

  1999cited by this paper
• Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes

  1999cited by this paper
• A core library for robust numeric and geometric computation

  1999cited by this paper
• MAPC: a library for efficient and exact manipulation of algebraic points and curves

  1999cited by this paper
• The Design and Implementation of Planar Maps in CGAL

  1999cited by this paper
• Applications of the Generic Programming Paradigm in the Design of CGAL

  1998cited by this paper
• Interval arithmetic yields efficient dynamic filters for computational geometry

  1998cited by this paper
• Conics and cubics

  1998cited by this paper
• Handbook of Discrete and Computational Geometry, Second Edition

  1997cited by this paper
• Computing in the Field of Complex Algebraic Numbers

  1997cited by this paper
• Computational geometry: algorithms and applications

  1997cited by this paper
• In handbook of discrete and computational geometry

  1997cited by this paper
• Ideals, Varieties, and Algorithms

  1997cited by this paper
• LEDA: a platform for combinatorial and geometric computing

  1997cited by this paper
• Static analysis yields efficient exact integer arithmetic for computational geometry

  1996cited by this paper
• An implementation for maintaining arrangements of polygons

  1995cited by this paper
• Finding the shortest path of a disc among polygonal obstacles using a radius-independent graph

  1995cited by this paper
• THE EXACT COMPUTATION PARADIGM 1

  1994cited by this paper
• Efficient Delaunay triangulation using rational arithmetic

  1991cited by this paper
• A fast planar partition algorithm. I

  1988cited by this paper
• A sweepline algorithm for Voronoi diagrams

  1986cited by this paper
• Computing in Algebraic Extensions

  1983cited by this paper
• Identification of Algebraic Numbers

  1982cited by this paper
• Generalization of Voronoi Diagrams in the Plane

  1981cited by this paper
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots

  1974cited by this paper
• Iteration methods for finding all zeros of a polynomial simultaneously

  1973cited by this paper
• 100 great problems of elementary mathematics : their history and solution

  1966cited by this paper

• Predicates of the 3D Apollonius Diagram

  2020cites this paper
• The EdgeConflict Predicate in the 3D Apollonius Diagram

  2018cites this paper
• Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves

  2017cites this paper
• Robust Geometric Computation

  2016cites this paper
• CGAL - Reliable Geometric Computing for Academia and Industry

  2014cites this paper
• Computing the Topology of an Arrangement of Implicit and Parametric Curves Given by Values

  2014cites this paper
• Exact Geometric and Algebraic Computations in CGAL

  2010cites this paper
• Continued Work on the Computation of an Exact Arrangement of Quadrics

  2009cites this paper
• Guarding Rectangular Partitions

  2009cites this paper
• Boolean Operations on Conic Polygons

  2009cites this paper
• Minkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere

  2009cites this paper
• Improving the topology computation of an arrangement of cubics

  2008cites this paper
• Exact and efficient 2D-arrangements of arbitrary algebraic curves

  2008cites this paper
• An Algorithm for the Computation of the Metric Average of Two Simple Polygons and Extensions Thesis submitted in partial fulfillment of the requirements for the M.Sc. degree in the School of Mathematical Sciences, Tel-Aviv University

  2008cites this paper
• Computing the topology of an arrangement of implicitly defined real algebraic plane curves

  2008cites this paper
• ROBUST EXPLICIT CONSTRUCTION OF 3D CONFIGURATION SPACES USING CONTROLLED LINEAR PERTURBATION

  2008cites this paper
• A CGAL-based Univariate Algebraic Kernel and Application to Arrangements

  2008cites this paper
• Evaluation of different approaches in 3 D curved kernel for arrangements of quadrics

  2008cites this paper
• Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics

  2007cites this paper
• Algorithms for Complex Shapes with Certified Numerics and Topology Complete , Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics

  2007cites this paper
• Computing the Topology of an Arrangement of Quartics

  2007cites this paper
• The integration of exact arrangements with effective motion planning

  2007cites this paper
• Exact and approximate construction of offset polygons

  2007cites this paper
• Project number IST-006413 ACS Algorithms for Complex Shapes with Certified Numerics and Topology Lower envelopes in 3 D : design of algorithms , data structures and interface , experimental comparison of algorithmic techniques

  2007cites this paper
• Advanced programming techniques applied to Cgal's arrangement package

  2007cites this paper
• Path planning in dynamic environments

  2007cites this paper
• Exact Computation of Arrangements of Rotated Conics

  2007cites this paper
• Combinatorial Geometry with Algorithmic Applications

  2006cites this paper
• An approximate arrangement algorithm for semi-algebraic curves

  2006cites this paper
• Exact, efficient, and complete arrangement computation for cubic curves

  2006cites this paper
• Complete subdivision algorithms, I: intersection of Bezier curves

  2006cites this paper
• Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces

  2006cites this paper
• The predicates of the Apollonius diagram: Algorithmic analysis and implementation

  2006influential citation
• Algorithms for Complex Shapes with Certified Numerics and Topology Exact and Efficient Construction of Planar Arrangements of Circular Arcs and Line Segments with Applications

  2006cites this paper
• An exact, complete and efficient implementation for computing planar maps of quadric intersection curves

  2005cites this paper
• Precise global collision detection in multi-axis NC-machining

  2005cites this paper
• EXACUS: Efficient and Exact Algorithms for Curves and Surfaces

  2005cites this paper
• The visibility--voronoi complex and its applications

  2005cites this paper
• A robust and efficient implementation for the segment Voronoi diagram

  2004cites this paper
• An Inconsistency Sensitive Arrangement Algorithm for Algebraic Curves

  2004cites this paper
• Complete, exact, and efficient computations with cubic curves

  2004cites this paper
• Exact Arrangements of Quadric Intersection Curves

  2004cites this paper
• Towards and open curved kernel

  2004influential citation
• ECG IST-2000-26473 Effective Computational Geometry for Curves and Surfaces ECG Technical Report No . : ECG-TR-361200-01 An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs ( preliminary version )

  2004cites this paper
• Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements

  2004cites this paper
• Continuous path verification in multi-axis NC-machining

  2004cites this paper
• An exact and efficient approach for computing a cell in an arrangement of quadrics

  2004cites this paper
• Controlled perturbation for arrangements of circles

  2003cites this paper
• Exact Arrangement Computation for Cubic Curves

  2003cites this paper
• Controlled Perturbation for Arrangements of Circles

  2003cites this paper
• Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves

  2003cites this paper
• Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve

  2003cites this paper
• Hybrid Motion Planning: Coordinating Two Discs Moving among Polygonal Obstacles in the Plane

  2002influential citation
• A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons

  2002influential citation