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

Berberich, Eric
Hemmer, Michael
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola

dblp
dblp
dblp
dblp
dblp

Not MPG Author(s):

Hemmer, Michael
Schömer, Elmar

Editor(s):

Mitchell, Joe
Rote, Günter
Kettner, Lutz

dblp
dblp
dblp

Not MPII Editor(s):

Mitchell, Joe
Rote, Günter

BibTeX cite key*:

bhksw-eceicpmqic-05

Title, Booktitle

Title*:

An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves

Booktitle*:

21st Annual Symposium on Computational Geometry (SCG'05)

Event, URLs

URL of the conference:

http://www.socg05.org/

URL for downloading the paper:


Event Address*:

Pisa, Italy

Language:

English

Event Date*
(no longer used):


Organization:

Association for Computing Machinery (ACM)

Event Start Date:

6 June 2005

Event End Date:

8 June 2005

Publisher

Name*:

ACM

URL:

http://www.acm.org

Address*:

New York, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:

June

Pages:

99-106

Year*:

2005

VG Wort Pages:

38

ISBN/ISSN:

1-58113-991-8

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We present the first exact, complete and
efficient implementation that computes for a given
set $P=\{p_1,\dots,p_n\}$ of quadric surfaces the
planar map induced by all intersection curves
$p_1\cap p_i$, $2\leq i\leq n$, running on the
surface of $p_1$. The vertices in this graph are the
singular and $x$-extreme points of the curves as well
as all intersection points of pairs of curves. Two
vertices are connected by an edge if the underlying
points are connected by a branch of one of the curves.
Our work is based on and extends ideas developed
in~[20] and~[9].

Our implementation is {\em complete} in the sense
that it can handle all kind of inputs including all
degenerate ones where intersection curves have
singularities or pairs of curves intersect with
high multiplicity. It is {\em exact} in that it
always computes the mathematical correct result.
It is {\em efficient} measured in running times.

HyperLinks / References / URLs:

http://www.mpi-inf.mpg.de/projects/EXACUS/



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

popular

Appearance:

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



BibTeX Entry:

@INPROCEEDINGS{bhksw-eceicpmqic-05,
AUTHOR = {Berberich, Eric and Hemmer, Michael and Kettner, Lutz and Sch{\"o}mer, Elmar and Wolpert, Nicola},
EDITOR = {Mitchell, Joe and Rote, G{\"u}nter and Kettner, Lutz},
TITLE = {An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves},
BOOKTITLE = {21st Annual Symposium on Computational Geometry (SCG'05)},
PUBLISHER = {ACM},
YEAR = {2005},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PAGES = {99--106},
ADDRESS = {Pisa, Italy},
MONTH = {June},
ISBN = {1-58113-991-8},
}


Entry last modified by Eric Berberich, 05/11/2006
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)
Eric Berberich
Created
11/08/2005 04:20:55 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Eric Berberich
Lutz Kettner
Lutz Kettner
Christine Kiesel
Christine Kiesel
Edit Dates
05/11/2006 09:54:09 PM
01/13/2006 10:58:21 AM
01/12/2006 10:12:10 PM
16.11.2005 15:37:23
11/08/2005 04:20:55 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section