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

Comes, Jochen
Ziegelmann, Mark

dblp
dblp



Editor(s):

Vitter, Jeffrey S.
Zaroliagis, Christos D.

dblp
dblp



BibTeX cite key*:

Ziegelmann1999

Title, Booktitle

Title*:

An Easy to Use Implementation of Linear Perturbations within CGAL

Booktitle*:

Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

London, UK

Language:

English

Event Date*
(no longer used):

July, 19 - July, 21

Organization:


Event Start Date:

Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected

Event End Date:

Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected

Publisher

Name*:

Springer

URL:


Address*:

Berlin

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

1668

Number:


Month:

September

Pages:

169-182

Year*:

1999

VG Wort Pages:


ISBN/ISSN:

3-540-6642-7-0

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Most geometric algorithms are formulated under the non-degeneracy assumption
which usually does not hold in practice.
When implementing such an algorithm, a treatment of degenerate
cases is necessary to prevent incorrect outputs or crashes. One
way to overcome this nontrivial task is to use perturbations.
In this paper we describe a generic implementation of efficient
random linear perturbations within CGAL and discuss the
practicality of using it examining the convex hull problem, line
segment intersection and Delaunay triangulation.

Keywords:

Computational Geometry, Perturbation, Degeneracies, Rapid Prototyping



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

Expert

Appearance:

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



BibTeX Entry:

@INPROCEEDINGS{Ziegelmann1999,
AUTHOR = {Comes, Jochen and Ziegelmann, Mark},
EDITOR = {Vitter, Jeffrey S. and Zaroliagis, Christos D.},
TITLE = {An Easy to Use Implementation of Linear Perturbations within CGAL},
BOOKTITLE = {Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99},
PUBLISHER = {Springer},
YEAR = {1999},
VOLUME = {1668},
PAGES = {169--182},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {London, UK},
MONTH = {September},
ISBN = {3-540-6642-7-0},
}


Entry last modified by Christine Kiesel, 03/02/2010
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)
Mark Ziegelmann
Created
02/07/2000 01:22:49 PM
Revisions
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Anja Becker
Anja Becker
Mark Ziegelmann
Edit Dates
28.08.2006 16:15:37
29.03.2000 13:05:36
29.03.2000 13:03:22
07/02/2000 13:22:49
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section