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

Lennerz, Christian
Schömer, Elmar

dblp
dblp



Editor(s):

Hiromasa, Suzuki
Ralph, Martin

dblp
dblp

Not MPII Editor(s):

Hiromasa, Suzuki
Ralph, Martin

BibTeX cite key*:

Lennerz2001

Title, Booktitle

Title*:

Efficient Distance Computation for Quadratic Curves and Surfaces

Booktitle*:

Proceedings of the 2nd Conference on Geometric Modeling and Processing

Event, URLs

URL of the conference:

http://www.riken.go.jp/lab-www/V-CAD/GMP2002/

URL for downloading the paper:


Event Address*:

Waiko, Saitama, Japan

Language:

English

Event Date*
(no longer used):

-- July, 10 - July, 12

Organization:

Institute of Electrical and Electronics Engineers (IEEE)

Event Start Date:

10 July 2002

Event End Date:

12 July 2002

Publisher

Name*:

IEEE

URL:

http://computer.org

Address*:

Los Alamitos, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:

July

Pages:

60-69

Year*:

2002

VG Wort Pages:

23

ISBN/ISSN:

0-7695-1674-2

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Virtual prototyping and assembly planning require physically based simulation techniques. In this setting the relevant objects are mostly mechanical parts, designed in CAD-programs.
When exported to the prototyping and planning systems, curved parts are approximated by large polygonal models, thus confronting the simulation algorithms with high complexity. Algorithms for collision detection in particular are a bottleneck of efficiency and suffer from accuracy and
robustness problems.
To overcome these problems, our algorithm directly operates on the original CAD-data. This approach reduces the input complexity and avoids accuracy problems due to approximation errors.
We present an efficient algorithm for computing the distance between patches of quadratic surfaces trimmed by quadratic curves. The distance calculation problem is reduced to the problem of solving univariate polynomials of a degree of at most 24. Moreover, we will identify an important subclass for which the degree of the polynomials is bounded by 8.

URL for the Abstract:

http://www.computer.org/proceedings/gmp/1674/16740060abs.htm

Keywords:

Distance Computation, Collision Detection, Curved Surfaces, Quadrics



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, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Lennerz2001,
AUTHOR = {Lennerz, Christian and Sch{\"o}mer, Elmar},
EDITOR = {Hiromasa, Suzuki and Ralph, Martin},
TITLE = {Efficient Distance Computation for Quadratic Curves and Surfaces},
BOOKTITLE = {Proceedings of the 2nd Conference on Geometric Modeling and Processing},
PUBLISHER = {IEEE},
YEAR = {2002},
ORGANIZATION = {Institute of Electrical and Electronics Engineers (IEEE)},
PAGES = {60--69},
ADDRESS = {Waiko, Saitama, Japan},
MONTH = {July},
ISBN = {0-7695-1674-2},
}


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)
Christian Lennerz
Created
12/18/2002 04:07:00 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Anja Becker
Christian Lennerz
Uwe Brahm
Uwe Brahm
Edit Dates
28.08.2003 16:00:03
09.05.2003 12:17:25
05/08/2003 10:36:43 AM
01/31/2003 11:42:43 AM
18/12/2002 16:07:00
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section