Computer Graphics & A Band Partitioning Algorithm for Contour Triangulation 


Vol. 7,  No. 3, pp. 943-952, Mar.  2000
10.3745/KIPSTE.2000.7.3.943


PDF
  Abstract

The surface reconstruction problem from a set of wire-frame contours is very important in diverse fields such as medical imaging or computer animation. In this paper, a surface triangulation method is proposed for solving the problem. Generally, many optimal triangulation techniques suffer from the large computation time but heuristic approaches may produce very unnatural surface when contours are widely different in shape. To compensate the disadvantages of these approaches, we propose a new heuristic triangulation method which iteratively decomposes the surface generation problem from a band (a pair of vertices chain) into two subproblems from two sub-bands. Generally, conventional greedy heuristic contour triangulation algorithm, suffer from the drastic error propagation during surface modeling when the adjacent contours are different in shape. Our divide-and-conquer algorithm, called band partitioning algorithm, processes eccentric parts of the contours first with more global information. Consequently, the resulting facet model becomes more stable and natural even though the shapes are widely different. An interesting property of our method is that it supports multi-resolution capability in surface modeling time. According to experiments, it is proved to be very robust and efficient in many applications.

  Statistics
  Cite this article

[IEEE Style]

Y. K. Choi and T. H. Cho, "Computer Graphics & A Band Partitioning Algorithm for Contour Triangulation," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 3, pp. 943-952, 2000. DOI: 10.3745/KIPSTE.2000.7.3.943.

[ACM Style]

Young Kyu Choi and Tai Hoon Cho. 2000. Computer Graphics & A Band Partitioning Algorithm for Contour Triangulation. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 3, (2000), 943-952. DOI: 10.3745/KIPSTE.2000.7.3.943.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals