Javascript must be enabled for the correct page display

Approximation of Implicit Curves Using the Bad Edge Refinement Concept

Moet, E.J. (2003) Approximation of Implicit Curves Using the Bad Edge Refinement Concept. Master's Thesis / Essay, Computing Science.

Infor_Ma_2003_EJMoet.CV.pdf - Published Version

Download (1MB) | Preview


Two-dimensional implicit curves are defined as the zero set of a function I R2 — R. Several algorithms for piecewise linear approximations of regular implicit curves exist, usually without guaranteeing a correct topology. In this thesis, we develop and implement an algorithm that guarantees to find a topologically correct, polygonal approximation of a given implicit curve. This adaptive enumeration algorithm uses mesh refinement, based on the bad edge concept, to refine both quadtree and Delaunay triangulation meshes. This theoretical framework then defines the curves topologically correct, piecewise linear approximation.

Item Type: Thesis (Master's Thesis / Essay)
Degree programme: Computing Science
Thesis type: Master's Thesis / Essay
Language: English
Date Deposited: 15 Feb 2018 07:29
Last Modified: 15 Feb 2018 07:30

Actions (login required)

View Item View Item