Bounding recursive procedural models using convex optimization

O. S. Lawlor, John C Hart

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

Abstract

We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the procedural model. Then we present an algorithm that expresses the IFS-bounding problem as a set of linear convex optimization. As such, our algorithm is guaranteed to find the recursively optimal bounding polyhedron, if it exists. Finally, we demonstrate examples of this algorithm on two and three dimensional recursive procedural models.

Original languageEnglish (US)
Title of host publicationProceedings - 11th Pacific Conference on Computer Graphics and Applications, PG 2003
EditorsReinhard Klein, Jon Rokne, Wenping Wang
PublisherIEEE Computer Society
Pages283-292
Number of pages10
ISBN (Electronic)0769520286
DOIs
StatePublished - Jan 1 2003
Event11th Pacific Conference on Computer Graphics and Applications, PG 2003 - Canmore, Canada
Duration: Oct 8 2003Oct 10 2003

Publication series

NameProceedings - Pacific Conference on Computer Graphics and Applications
Volume2003-January
ISSN (Print)1550-4085

Other

Other11th Pacific Conference on Computer Graphics and Applications, PG 2003
CountryCanada
CityCanmore
Period10/8/0310/10/03

Keywords

  • Computer graphics
  • Computer science
  • Constraint optimization
  • Fractals
  • Geometry
  • Layout
  • Shape
  • Solid modeling
  • Testing
  • Tree graphs

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design
  • Modeling and Simulation

Fingerprint Dive into the research topics of 'Bounding recursive procedural models using convex optimization'. Together they form a unique fingerprint.

  • Cite this

    Lawlor, O. S., & Hart, J. C. (2003). Bounding recursive procedural models using convex optimization. In R. Klein, J. Rokne, & W. Wang (Eds.), Proceedings - 11th Pacific Conference on Computer Graphics and Applications, PG 2003 (pp. 283-292). [1238270] (Proceedings - Pacific Conference on Computer Graphics and Applications; Vol. 2003-January). IEEE Computer Society. https://doi.org/10.1109/PCCGA.2003.1238270