Sweeping Arrangements of Cubic Segments Exactly and Efficiently

Eigenwillig, Arno; Schömer, Elmar; Wolpert, Nicola

Local TagsRelease HistoryDetailsSummary

Sweeping Arrangements of Cubic Segments Exactly and Efficiently

Eigenwillig, A., Schömer, E., & Wolpert, N.(2002). Sweeping Arrangements of Cubic Segments Exactly and Efficiently (ECG-TR-182202-01). Sophia Antipolis: Effective Computational Geometry for Curves and Surfaces.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0019-EB42-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0019-EB44-3

Genre: Report

Files

show Files

Locators

show

Creators

show

hide

Creators:
Eigenwillig, Arno¹, Author
Schömer, Elmar¹, Author
Wolpert, Nicola¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

hide

Free keywords: -

Abstract: A method is presented to compute the planar arrangement induced by segments of algebraic curves of degree three (or less), using an improved Bentley-Ottmann sweep-line algorithm. Our method is exact (it provides the mathematically correct result), complete (it handles all possible geometric degeneracies), and efficient (the implementation can handle hundreds of segments). The range of possible input segments comprises conic arcs and cubic splines as special cases of particular practical importance.

Details

show

hide

Language(s): eng - English

Dates: Date issued: 2002

Publication Status: Issued

Pages: -

Publishing info: Sophia Antipolis : Effective Computational Geometry for Curves and Surfaces

Table of Contents: -

Rev. Type: -

Identifiers: Report Nr.: ECG-TR-182202-01
BibTex Citekey: esw-sacsee-02

Degree: -

Event

show

Legal Case

show

Project information

show

Source

show