Complete subdivision algorithms, I

Intersection of Bezier curves

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algorithms is based on geometric separation bounds, and using a criterion for detecting non-crossing intersection of curves. Our algorithm is adaptive, being based only on exact bigfloat computations. In particular, we avoid manipulation of algebraic numbers and resultant computations. It is designed to be competitive with current algorithms on "nice" inputs. All standard algorithms assume F, G to be relatively prime - our algorithm needs a generalization of this.

Original languageEnglish (US)
Title of host publicationProceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06
Pages217-226
Number of pages10
Volume2006
StatePublished - 2006
Event22nd Annual Symposium on Computational Geometry 2006, SCG'06 - Sedona, AZ, United States
Duration: Jun 5 2006Jun 7 2006

Other

Other22nd Annual Symposium on Computational Geometry 2006, SCG'06
CountryUnited States
CitySedona, AZ
Period6/5/066/7/06

Fingerprint

Subdivision Algorithm
Bézier Curves
Intersection
Exact Computation
Relatively prime
Algebraic number
Robust Algorithm
Manipulation
Adaptive algorithms
Curve

Keywords

  • Bezier curves
  • Computational geometry
  • Curve intersection
  • Exact geometric computation
  • Robust numerical algorithms
  • Subdivision method

ASJC Scopus subject areas

  • Software
  • Geometry and Topology
  • Safety, Risk, Reliability and Quality
  • Chemical Health and Safety

Cite this

Yap, C. K. (2006). Complete subdivision algorithms, I: Intersection of Bezier curves. In Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06 (Vol. 2006, pp. 217-226)

Complete subdivision algorithms, I : Intersection of Bezier curves. / Yap, Chee K.

Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Vol. 2006 2006. p. 217-226.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yap, CK 2006, Complete subdivision algorithms, I: Intersection of Bezier curves. in Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. vol. 2006, pp. 217-226, 22nd Annual Symposium on Computational Geometry 2006, SCG'06, Sedona, AZ, United States, 6/5/06.
Yap CK. Complete subdivision algorithms, I: Intersection of Bezier curves. In Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Vol. 2006. 2006. p. 217-226
Yap, Chee K. / Complete subdivision algorithms, I : Intersection of Bezier curves. Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Vol. 2006 2006. pp. 217-226
@inproceedings{4854d49f164f445ca03fb17bc3a5b3dc,
title = "Complete subdivision algorithms, I: Intersection of Bezier curves",
abstract = "We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algorithms is based on geometric separation bounds, and using a criterion for detecting non-crossing intersection of curves. Our algorithm is adaptive, being based only on exact bigfloat computations. In particular, we avoid manipulation of algebraic numbers and resultant computations. It is designed to be competitive with current algorithms on {"}nice{"} inputs. All standard algorithms assume F, G to be relatively prime - our algorithm needs a generalization of this.",
keywords = "Bezier curves, Computational geometry, Curve intersection, Exact geometric computation, Robust numerical algorithms, Subdivision method",
author = "Yap, {Chee K.}",
year = "2006",
language = "English (US)",
isbn = "1595933409",
volume = "2006",
pages = "217--226",
booktitle = "Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06",

}

TY - GEN

T1 - Complete subdivision algorithms, I

T2 - Intersection of Bezier curves

AU - Yap, Chee K.

PY - 2006

Y1 - 2006

N2 - We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algorithms is based on geometric separation bounds, and using a criterion for detecting non-crossing intersection of curves. Our algorithm is adaptive, being based only on exact bigfloat computations. In particular, we avoid manipulation of algebraic numbers and resultant computations. It is designed to be competitive with current algorithms on "nice" inputs. All standard algorithms assume F, G to be relatively prime - our algorithm needs a generalization of this.

AB - We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algorithms is based on geometric separation bounds, and using a criterion for detecting non-crossing intersection of curves. Our algorithm is adaptive, being based only on exact bigfloat computations. In particular, we avoid manipulation of algebraic numbers and resultant computations. It is designed to be competitive with current algorithms on "nice" inputs. All standard algorithms assume F, G to be relatively prime - our algorithm needs a generalization of this.

KW - Bezier curves

KW - Computational geometry

KW - Curve intersection

KW - Exact geometric computation

KW - Robust numerical algorithms

KW - Subdivision method

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

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

M3 - Conference contribution

SN - 1595933409

SN - 9781595933409

VL - 2006

SP - 217

EP - 226

BT - Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06

ER -