DocumentCode :
2434981
Title :
Profiling using the connection of intersection lines from triangle soup
Author :
Park, Han-Wook ; Lee, Sung-Ho ; Kim, Chang-Hun
Author_Institution :
Korea Univ., Seoul
fYear :
2007
fDate :
17-20 Oct. 2007
Firstpage :
2812
Lastpage :
2815
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 :
computational geometry; mesh generation; intersection line; mesh geometry; profile polygon; singularity problem; triangle soup; vector format; Automatic control; Automation; Computational geometry; Computer science; Control systems; Data structures; Electronic mail; Geometrical optics; Prototypes; Shape; Intersection lines; Mesh processing; Profiling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control, Automation and Systems, 2007. ICCAS '07. International Conference on
Conference_Location :
Seoul
Print_ISBN :
978-89-950038-6-2
Electronic_ISBN :
978-89-950038-6-2
Type :
conf
DOI :
10.1109/ICCAS.2007.4406848
Filename :
4406848
Link To Document :
بازگشت