A non-uniform binary space partition algorithm for 2D implicit curves

Authors:
Francisco Morgado;Abel Gomes
Affiliations:
Networks and Multimedia Group, Institute for Telecommunications, Department of Informatics, University of Beira Interior, Covilhã, Portugal;Networks and Multimedia Group, Institute for Telecommunications, Department of Informatics, University of Beira Interior, Covilhã, Portugal
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Year:
2003

Citing 11
Cited 0

Marching cubes: A high resolution 3D surface construction algorithm

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Polygonization of implicit surfaces

Computer Aided Geometric Design
Numerical continuation methods: an introduction

Numerical continuation methods: an introduction
Simplicial pivoting for mesh generation of implicitly defined surfaces

Computer Aided Geometric Design
Interval analysis for computer graphics

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
An implicit surface polygonizer

Graphics gems IV
Numeric-symbolic algorithms for evaluating one-dimensional algebraic sets

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
MAPC: a library for efficient and exact manipulation of algebraic points and curves

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A Generalization of Algebraic Surface Drawing

ACM Transactions on Graphics (TOG)
A Tracking Algorithm for Implicitly Defined Curves

IEEE Computer Graphics and Applications
Robust Adaptive Approximation of Implicit Curves

SIBGRAPI '01 Proceedings of the XIV Brazilian Symposium on Computer Graphics and Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current graphical systems include primitives to draw straight-line segments, circles, Bézier curves and surfaces, NURBS (Non-Uniform Rational B-Splines), but many of them fail displaying curve singularities (self-intersections) correctly. This paper introduces a fast and robust non-uniform binary space partition (BSP) algorithm for implicit curves possibly with self-intersections and other differentiable singularities. These singularities are computed without using traditional differential techniques.