Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Eigenwillig, Arno
Kerber, Michael

dblp
dblp



Editor(s):





BibTeX cite key*:

ek-eae2aoaac-08

Title, Booktitle

Title*:

Exact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves


ek-arrangements-2008-authprep.pdf (259.2 KB)

Booktitle*:

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08)

Event, URLs

URL of the conference:

http://www.siam.org/meetings/da08/

URL for downloading the paper:


Event Address*:

San Francisco, USA

Language:

English

Event Date*
(no longer used):


Organization:

ACM-SIAM

Event Start Date:

20 January 2008

Event End Date:

22 January 2008

Publisher

Name*:

ACM/SIAM
This proceedings has no publisher!

URL:


Address*:

New York, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:

January

Pages:

122-131

Year*:

2008

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives reduce to cylindrical algebraic decompositions of the plane for one or two curves. We compute them by a new and efficient method that combines adaptive-precision root finding (the Bitstream Descartes method of Eigenwillig et~al.,\ 2005) with a small number of symbolic computations, and that delivers the exact result in all cases. Thus we obtain an algorithm which produces the mathematically true arrangement, undistorted by rounding error, for any set of input segments. Our algorithm is implemented in the EXACUS library AlciX. We report on experiments; they indicate the efficiency of our approach.

Copyright Message:

Copyright SIAM 2008. This is an author-prepared version of the article


Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{ek-eae2aoaac-08,
AUTHOR = {Eigenwillig, Arno and Kerber, Michael},
TITLE = {Exact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves},
BOOKTITLE = {Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08)},
PUBLISHER = {ACM/SIAM},
YEAR = {2008},
ORGANIZATION = {ACM-SIAM},
PAGES = {122--131},
ADDRESS = {San Francisco, USA},
MONTH = {January},
}


Entry last modified by Michael Kerber, 03/03/2009
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Michael Kerber
Created
10/10/2007 05:20:33 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Michael Kerber
Michael Kerber
Michael Kerber
Michael Kerber
Michael Kerber
Edit Dates
01/29/2008 09:51:00 AM
10/11/2007 12:25:50 PM
10/11/2007 12:24:50 PM
10/10/2007 05:21:24 PM
10/10/2007 05:20:33 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
ek-arrangements-2008-authprep.pdf