Title: Finding Thin Points in an Abstract Cellular Complex
Authors: Ungvichian, Varakorn
Kanongchaiyos, Pizzanu
Citation: WSCG '2007: Short Communications Proceedings: The 15th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2007 in co-operation with EUROGRAPHICS: University of West Bohemia, Plzen, Czech Republic, January 29 – February 1, 2007, p. 81-88.
Issue Date: 2007
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/wscg2007/Papers_2007/short/!WSCG2007_Short_Proceedings_Final-Part_1.zip
ISBN: 978-80-86943-02-2
Keywords: geometrie;počítačová grafika;abstraktní buněčný komplex;topologie
Keywords in different language: geometry;computer graphics;abstract cellular complex;topology
Abstract: This research describes an algorithm to find “thin points'” in a solid represented as an Abstract Cellular Complex. The algorithm is mostly iterative, adding one face at a time to a set of previously selected faces, and choosing the selections that produce the loops with the shortest lengths for the next iteration. The output from the algorithm is a set of loops that indicate the thinnest portions of the solid. As implemented, the algorithm allows a threshold to be set to limit the number of loops that are selected in each iteration. The results indicate that, while it does occasionally produce errors, the algorithm is mostly accurate, and a lower threshold increases its speed, without negatively affecting its accuracy.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2007: Short Communications Proceedings

Files in This Item:
File Description SizeFormat 
Ungvichian.pdfPlný text826,6 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11166

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.