Computation of self-intersections of offsets of bézier surface patches

Takashi Maekawa, Wonjoon Cho, Nicholas M. Patrikalakis

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

Self-intersection of offsets of regular Bezier surface patches due to local differential geometry and global distance function properties is investigated. The problem of computing starting points for tracing self-intersection curves of offsets is formulated in terms of a system of nonlinear polynomial equations and solved robustly by the interval projected polyhedron algorithm. Trivial solutions are excluded by evaluating the normal bounding pyramids of the surface subpatches mapped from the parameter boxes computed by the polynomial solver with a coarse tolerance. A technique to detect and trace self-intersection curve loops in the parameter domain is also discussed. The method has been successfully tested in tracing complex self-intersection curves of offsets of Bezier surface patches. Examples illustrate the principal features and robustness characteristics of the method.

Original languageEnglish
Pages (from-to)275-283
Number of pages9
JournalJournal of Mechanical Design, Transactions Of the ASME
Volume119
Issue number2
DOIs
Publication statusPublished - 1997 Jan 1
Externally publishedYes

Fingerprint

Polynomials
Geometry

ASJC Scopus subject areas

  • Mechanics of Materials
  • Mechanical Engineering
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Cite this

Computation of self-intersections of offsets of bézier surface patches. / Maekawa, Takashi; Cho, Wonjoon; Patrikalakis, Nicholas M.

In: Journal of Mechanical Design, Transactions Of the ASME, Vol. 119, No. 2, 01.01.1997, p. 275-283.

Research output: Contribution to journalArticle

@article{559e8fa4169b4e0ba6f22ed42411a965,
title = "Computation of self-intersections of offsets of b{\'e}zier surface patches",
abstract = "Self-intersection of offsets of regular Bezier surface patches due to local differential geometry and global distance function properties is investigated. The problem of computing starting points for tracing self-intersection curves of offsets is formulated in terms of a system of nonlinear polynomial equations and solved robustly by the interval projected polyhedron algorithm. Trivial solutions are excluded by evaluating the normal bounding pyramids of the surface subpatches mapped from the parameter boxes computed by the polynomial solver with a coarse tolerance. A technique to detect and trace self-intersection curve loops in the parameter domain is also discussed. The method has been successfully tested in tracing complex self-intersection curves of offsets of Bezier surface patches. Examples illustrate the principal features and robustness characteristics of the method.",
author = "Takashi Maekawa and Wonjoon Cho and Patrikalakis, {Nicholas M.}",
year = "1997",
month = "1",
day = "1",
doi = "10.1115/1.2826247",
language = "English",
volume = "119",
pages = "275--283",
journal = "Journal of Mechanical Design - Transactions of the ASME",
issn = "1050-0472",
publisher = "American Society of Mechanical Engineers(ASME)",
number = "2",

}

TY - JOUR

T1 - Computation of self-intersections of offsets of bézier surface patches

AU - Maekawa, Takashi

AU - Cho, Wonjoon

AU - Patrikalakis, Nicholas M.

PY - 1997/1/1

Y1 - 1997/1/1

N2 - Self-intersection of offsets of regular Bezier surface patches due to local differential geometry and global distance function properties is investigated. The problem of computing starting points for tracing self-intersection curves of offsets is formulated in terms of a system of nonlinear polynomial equations and solved robustly by the interval projected polyhedron algorithm. Trivial solutions are excluded by evaluating the normal bounding pyramids of the surface subpatches mapped from the parameter boxes computed by the polynomial solver with a coarse tolerance. A technique to detect and trace self-intersection curve loops in the parameter domain is also discussed. The method has been successfully tested in tracing complex self-intersection curves of offsets of Bezier surface patches. Examples illustrate the principal features and robustness characteristics of the method.

AB - Self-intersection of offsets of regular Bezier surface patches due to local differential geometry and global distance function properties is investigated. The problem of computing starting points for tracing self-intersection curves of offsets is formulated in terms of a system of nonlinear polynomial equations and solved robustly by the interval projected polyhedron algorithm. Trivial solutions are excluded by evaluating the normal bounding pyramids of the surface subpatches mapped from the parameter boxes computed by the polynomial solver with a coarse tolerance. A technique to detect and trace self-intersection curve loops in the parameter domain is also discussed. The method has been successfully tested in tracing complex self-intersection curves of offsets of Bezier surface patches. Examples illustrate the principal features and robustness characteristics of the method.

UR - http://www.scopus.com/inward/record.url?scp=0031165959&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031165959&partnerID=8YFLogxK

U2 - 10.1115/1.2826247

DO - 10.1115/1.2826247

M3 - Article

VL - 119

SP - 275

EP - 283

JO - Journal of Mechanical Design - Transactions of the ASME

JF - Journal of Mechanical Design - Transactions of the ASME

SN - 1050-0472

IS - 2

ER -