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):

Dupont, Laurent
Hemmer, Michael
Petitjean, Sylvain
Schömer, Elmar

dblp
dblp
dblp
dblp

Not MPG Author(s):

Dupont, Laurent
Petitjean, Sylvain
Schömer, Elmar

Editor(s):

Arge, Lars
Hoffmann, Michael
Welzl, Emo

dblp
dblp
dblp

Not MPII Editor(s):

Arge, Lars
Hoffmann, Michael
Welzl, Emo

BibTeX cite key*:

Hemmer2007

Title, Booktitle

Title*:

Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics

Booktitle*:

15th Annual European Symposium on Algorithms

Event, URLs

URL of the conference:

http://www.algo07.cs.tau.ac.il/esa.html

URL for downloading the paper:


Event Address*:

Eilat, Israel

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

8 October 2007

Event End Date:

10 October 2007

Publisher

Name*:

Springer

URL:

http://www.springer.com/

Address*:

Heidelberg

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

4698

Number:


Month:

October

Pages:

633-644

Year*:

2007

VG Wort Pages:


ISBN/ISSN:

978-3-540-75519-7

Sequence Number:


DOI:

10.1007/978-3-540-75520-3_56



Note, Abstract, ©


(LaTeX) Abstract:

We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is complete in the sense that it can handle all kinds of inputs including all degenerate ones, i.e. singularities or tangential intersection points. It is exact in that it always computes the mathematically correct result. It is efficient measured in running times, i.e. it compares favorably to the only previous implementation.

URL for the Abstract:

http://www.springerlink.com/content/07745v32l5545648/?p=7bc7ed16a5c945898b8ccea8bea17662&pi=1

Keywords:

Exact Geometric Computing, Arrangements, Quadrics



Download
Access Level:

MPG

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Research Context:

Exact Geometric Computing

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{Hemmer2007,
AUTHOR = {Dupont, Laurent and Hemmer, Michael and Petitjean, Sylvain and Sch{\"o}mer, Elmar},
EDITOR = {Arge, Lars and Hoffmann, Michael and Welzl, Emo},
TITLE = {Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics},
BOOKTITLE = {15th Annual European Symposium on Algorithms},
PUBLISHER = {Springer},
YEAR = {2007},
VOLUME = {4698},
PAGES = {633--644},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Eilat, Israel},
MONTH = {October},
ISBN = {978-3-540-75519-7},
DOI = {10.1007/978-3-540-75520-3_56},
}


Entry last modified by Michael Hemmer, 03/24/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 Hemmer
Created
01/26/2009 01:40:52 PM
Revisions
3.
2.
1.
0.
Editor(s)
Michael Hemmer
Michael Hemmer
Michael Hemmer
Michael Hemmer
Edit Dates
03/24/2009 04:21:59 PM
01/26/2009 02:52:48 PM
01/26/2009 02:46:41 PM
01/26/2009 01:40:52 PM