Efficient evaluation of continuous signed distance to a polygonal mesh

Mathieu Sanchez, Oleg Fryazinov, Alexander Pasko

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

9 Citations (Scopus)

Abstract

An efficient representation of a polygonal mesh by a signed continuous distance field is the main focus of this work. We compare different approaches to implementing such a representation and choose the most efficient one. Several optimizations to the existing methods are presented including the new traversal technique for the BVH-based signed distance evaluation and packet queries. We also discuss details of the GPU implementation of the efficient signed distance evaluation. Several application examples are presented such as blending set operations, linear metamorphosis, space-time blending and microstructure generation for polygonal meshes.

Original languageEnglish
Title of host publicationProceedings - SCCG 2012
Subtitle of host publication28th Spring Conference on Computer Graphics
Pages101-108
Number of pages8
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event28th Spring Conference on Computer Graphics, SCCG 2012 - Budmerice, Slovakia
Duration: 2 May 20124 May 2012

Publication series

NameProceedings - SCCG 2012: 28th Spring Conference on Computer Graphics

Conference

Conference28th Spring Conference on Computer Graphics, SCCG 2012
Country/TerritorySlovakia
CityBudmerice
Period2/05/124/05/12

Keywords

  • Implicit surfaces
  • Polygonal mesh
  • Signed distance

Fingerprint

Dive into the research topics of 'Efficient evaluation of continuous signed distance to a polygonal mesh'. Together they form a unique fingerprint.

Cite this