Non-local isotopic approximation of nonsingular surfaces

Long Lin, Chee Yap, Jihun Yu

Research output: Contribution to journalArticle

Abstract

We consider the problem of approximating nonsingular surfaces which are implicitly represented by equations of the form f(x,y,z)=0. Our correctness criterion is an isotopy of the approximate surface to the exact surface. We focus on methods based on domain subdivision using numerical primitives. Such methods are practical and have adaptive and local complexity. Previously, Snyder (1992) [3] and Plantinga-Vegter (2004) [4] have introduced techniques based on parameterizability and non-local isotopy, respectively. In our previous work (SoCG 2009), we synthesized these two techniques into an efficient and practical algorithm for curves. This paper extends our approach to surfaces. The extension is by no means routine: the correctness argument is much more intricate. Unlike the 2-D case, a new phenomenon arises in which local rules for constructing surfaces are no longer sufficient. We treat an important extension to exploit anisotropic subdivision. Anisotropy means that we allow boxes to be split into 2, 4 or 8 subboxes with arbitrary but bounded aspect ratio. This could greatly improve the adaptivity of the algorithm. Our algorithms are relatively easy to implement, as the underlying primitives are based on interval arithmetic and exact BigFloat numbers. We report on encouraging preliminary experimental results.

Original languageEnglish (US)
Pages (from-to)451-462
Number of pages12
JournalCAD Computer Aided Design
Volume45
Issue number2
DOIs
StatePublished - Feb 2013

Fingerprint

Aspect ratio
Anisotropy

Keywords

  • Exact numerical algorithms
  • Interval methods
  • Isotopy
  • Mesh generation
  • Parameterizability
  • Subdivision algorithms
  • Surface approximation
  • Topological correctness

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Science Applications
  • Industrial and Manufacturing Engineering

Cite this

Non-local isotopic approximation of nonsingular surfaces. / Lin, Long; Yap, Chee; Yu, Jihun.

In: CAD Computer Aided Design, Vol. 45, No. 2, 02.2013, p. 451-462.

Research output: Contribution to journalArticle

Lin, Long ; Yap, Chee ; Yu, Jihun. / Non-local isotopic approximation of nonsingular surfaces. In: CAD Computer Aided Design. 2013 ; Vol. 45, No. 2. pp. 451-462.
@article{9079bbb3c8394b099c2dce248c162e6a,
title = "Non-local isotopic approximation of nonsingular surfaces",
abstract = "We consider the problem of approximating nonsingular surfaces which are implicitly represented by equations of the form f(x,y,z)=0. Our correctness criterion is an isotopy of the approximate surface to the exact surface. We focus on methods based on domain subdivision using numerical primitives. Such methods are practical and have adaptive and local complexity. Previously, Snyder (1992) [3] and Plantinga-Vegter (2004) [4] have introduced techniques based on parameterizability and non-local isotopy, respectively. In our previous work (SoCG 2009), we synthesized these two techniques into an efficient and practical algorithm for curves. This paper extends our approach to surfaces. The extension is by no means routine: the correctness argument is much more intricate. Unlike the 2-D case, a new phenomenon arises in which local rules for constructing surfaces are no longer sufficient. We treat an important extension to exploit anisotropic subdivision. Anisotropy means that we allow boxes to be split into 2, 4 or 8 subboxes with arbitrary but bounded aspect ratio. This could greatly improve the adaptivity of the algorithm. Our algorithms are relatively easy to implement, as the underlying primitives are based on interval arithmetic and exact BigFloat numbers. We report on encouraging preliminary experimental results.",
keywords = "Exact numerical algorithms, Interval methods, Isotopy, Mesh generation, Parameterizability, Subdivision algorithms, Surface approximation, Topological correctness",
author = "Long Lin and Chee Yap and Jihun Yu",
year = "2013",
month = "2",
doi = "10.1016/j.cad.2012.10.028",
language = "English (US)",
volume = "45",
pages = "451--462",
journal = "CAD Computer Aided Design",
issn = "0010-4485",
publisher = "Elsevier Limited",
number = "2",

}

TY - JOUR

T1 - Non-local isotopic approximation of nonsingular surfaces

AU - Lin, Long

AU - Yap, Chee

AU - Yu, Jihun

PY - 2013/2

Y1 - 2013/2

N2 - We consider the problem of approximating nonsingular surfaces which are implicitly represented by equations of the form f(x,y,z)=0. Our correctness criterion is an isotopy of the approximate surface to the exact surface. We focus on methods based on domain subdivision using numerical primitives. Such methods are practical and have adaptive and local complexity. Previously, Snyder (1992) [3] and Plantinga-Vegter (2004) [4] have introduced techniques based on parameterizability and non-local isotopy, respectively. In our previous work (SoCG 2009), we synthesized these two techniques into an efficient and practical algorithm for curves. This paper extends our approach to surfaces. The extension is by no means routine: the correctness argument is much more intricate. Unlike the 2-D case, a new phenomenon arises in which local rules for constructing surfaces are no longer sufficient. We treat an important extension to exploit anisotropic subdivision. Anisotropy means that we allow boxes to be split into 2, 4 or 8 subboxes with arbitrary but bounded aspect ratio. This could greatly improve the adaptivity of the algorithm. Our algorithms are relatively easy to implement, as the underlying primitives are based on interval arithmetic and exact BigFloat numbers. We report on encouraging preliminary experimental results.

AB - We consider the problem of approximating nonsingular surfaces which are implicitly represented by equations of the form f(x,y,z)=0. Our correctness criterion is an isotopy of the approximate surface to the exact surface. We focus on methods based on domain subdivision using numerical primitives. Such methods are practical and have adaptive and local complexity. Previously, Snyder (1992) [3] and Plantinga-Vegter (2004) [4] have introduced techniques based on parameterizability and non-local isotopy, respectively. In our previous work (SoCG 2009), we synthesized these two techniques into an efficient and practical algorithm for curves. This paper extends our approach to surfaces. The extension is by no means routine: the correctness argument is much more intricate. Unlike the 2-D case, a new phenomenon arises in which local rules for constructing surfaces are no longer sufficient. We treat an important extension to exploit anisotropic subdivision. Anisotropy means that we allow boxes to be split into 2, 4 or 8 subboxes with arbitrary but bounded aspect ratio. This could greatly improve the adaptivity of the algorithm. Our algorithms are relatively easy to implement, as the underlying primitives are based on interval arithmetic and exact BigFloat numbers. We report on encouraging preliminary experimental results.

KW - Exact numerical algorithms

KW - Interval methods

KW - Isotopy

KW - Mesh generation

KW - Parameterizability

KW - Subdivision algorithms

KW - Surface approximation

KW - Topological correctness

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

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

U2 - 10.1016/j.cad.2012.10.028

DO - 10.1016/j.cad.2012.10.028

M3 - Article

VL - 45

SP - 451

EP - 462

JO - CAD Computer Aided Design

JF - CAD Computer Aided Design

SN - 0010-4485

IS - 2

ER -