Computing polygonal surfaces from unions of balls

Roger Tam*, Wolfgang Heidrich

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a new algorithm for computing a polygonal surface from a union of balls. The method computes and connects the singular points of a given union of balls in an efficient manner to approximate the boundary. The algorithm uses the dual shape of the balls to give the resulting surface the correct topology. Our method is simple and demonstrated to be robust.

Original languageEnglish (US)
Title of host publicationProceedings - Computer Graphics International, CGI 2004
Pages86-92
Number of pages7
DOIs
StatePublished - Oct 25 2004
EventProceedings - Computer Graphics International, CGI 2004 - Crete, Greece
Duration: Jun 16 2004Jun 19 2004

Publication series

NameProceedings of Computer Graphics International Conference, CGI
ISSN (Print)1530-1052

Other

OtherProceedings - Computer Graphics International, CGI 2004
CountryGreece
CityCrete
Period06/16/0406/19/04

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design

Fingerprint

Dive into the research topics of 'Computing polygonal surfaces from unions of balls'. Together they form a unique fingerprint.

Cite this