Profiling using the connection of intersection lines from triangle soup

Han Wook Park, Sung Ho Lee, Chang-Hun Kim

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

Abstract

We propose an algorithm profiling mesh geometry which consists of triangle soup. Our profile is set of polygons in vector format. We construct a profile by calculating intersection lines from each triangle and profiling plane, and connect the lines. To avoid singularity problem, we classified configurations of triangle and the plane, and process it individually. Our implementation showed that the algorithm well captures profile polygons.

Original languageEnglish
Title of host publicationICCAS 2007 - International Conference on Control, Automation and Systems
Pages2812-2815
Number of pages4
DOIs
Publication statusPublished - 2007 Dec 1
EventInternational Conference on Control, Automation and Systems, ICCAS 2007 - Seoul, Korea, Republic of
Duration: 2007 Oct 172007 Oct 20

Other

OtherInternational Conference on Control, Automation and Systems, ICCAS 2007
CountryKorea, Republic of
CitySeoul
Period07/10/1707/10/20

Keywords

  • Intersection lines
  • Mesh processing
  • Profiling

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Profiling using the connection of intersection lines from triangle soup'. Together they form a unique fingerprint.

  • Cite this

    Park, H. W., Lee, S. H., & Kim, C-H. (2007). Profiling using the connection of intersection lines from triangle soup. In ICCAS 2007 - International Conference on Control, Automation and Systems (pp. 2812-2815). [4406848] https://doi.org/10.1109/ICCAS.2007.4406848