A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
Lists
Only you see this
Abstract
We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and an algorithm for computing the arrangement of conic arcs that immediately leads to a realization of regularized boolean operations on conic polygons. A conic polygon, or polygon for short, is anything that can be obtained from linear or conic halfspaces (= the set of points where a linear or quadratic function is non-negative) by regularized boolean operations. The algorithm and its implementation are complete (they can handle all cases), exact (they give the mathematically correct result), and efficient (they can handle inputs with several hundred primitives).
BibTeX
@inproceedings{berberich2002computational,
author = {Eric Berberich and Arno Eigenwillig and Michael Hemmer and Susan Hert and Kurt Mehlhorn and Elmar Schömer},
title = {{A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons}},
booktitle = {ESA},
year = {2002},
url = {https://openreview.net/forum?id=fBXdm05L3gC},
}Loading related content...