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

Fingerprint

Geometry

Keywords

  • Intersection lines
  • Mesh processing
  • Profiling

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

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

Profiling using the connection of intersection lines from triangle soup. / Park, Han Wook; Lee, Sung Ho; Kim, Chang-Hun.

ICCAS 2007 - International Conference on Control, Automation and Systems. 2007. p. 2812-2815 4406848.

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

Park, HW, Lee, SH & Kim, C-H 2007, Profiling using the connection of intersection lines from triangle soup. in ICCAS 2007 - International Conference on Control, Automation and Systems., 4406848, pp. 2812-2815, International Conference on Control, Automation and Systems, ICCAS 2007, Seoul, Korea, Republic of, 07/10/17. https://doi.org/10.1109/ICCAS.2007.4406848
Park HW, Lee SH, Kim C-H. Profiling using the connection of intersection lines from triangle soup. In ICCAS 2007 - International Conference on Control, Automation and Systems. 2007. p. 2812-2815. 4406848 https://doi.org/10.1109/ICCAS.2007.4406848
Park, Han Wook ; Lee, Sung Ho ; Kim, Chang-Hun. / Profiling using the connection of intersection lines from triangle soup. ICCAS 2007 - International Conference on Control, Automation and Systems. 2007. pp. 2812-2815
@inproceedings{e7412ec4366c49b29c07ea48c280db99,
title = "Profiling using the connection of intersection lines from triangle soup",
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.",
keywords = "Intersection lines, Mesh processing, Profiling",
author = "Park, {Han Wook} and Lee, {Sung Ho} and Chang-Hun Kim",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/ICCAS.2007.4406848",
language = "English",
isbn = "8995003871",
pages = "2812--2815",
booktitle = "ICCAS 2007 - International Conference on Control, Automation and Systems",

}

TY - GEN

T1 - Profiling using the connection of intersection lines from triangle soup

AU - Park, Han Wook

AU - Lee, Sung Ho

AU - Kim, Chang-Hun

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

KW - Intersection lines

KW - Mesh processing

KW - Profiling

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

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

U2 - 10.1109/ICCAS.2007.4406848

DO - 10.1109/ICCAS.2007.4406848

M3 - Conference contribution

AN - SCOPUS:48349097955

SN - 8995003871

SN - 9788995003879

SP - 2812

EP - 2815

BT - ICCAS 2007 - International Conference on Control, Automation and Systems

ER -