Efficient evaluation of continuous signed distance to a polygonal mesh

This source preferred by Oleg Fryazinov and Mathieu Sanchez

This data was imported from DBLP:

Authors: Sanchez, M., Fryazinov, O. and Pasko, A.A.

Editors: O'Sullivan, C.

http://dl.acm.org/citation.cfm?id=2448531

Journal: SCCG

Pages: 101-108

Publisher: ACM

ISBN: 978-1-4503-1977-5

This data was imported from Scopus:

Authors: Sanchez, M., Fryazinov, O. and Pasko, A.

Journal: Proceedings - SCCG 2012: 28th Spring Conference on Computer Graphics

Pages: 101-108

ISBN: 9781450319775

DOI: 10.1145/2448531.2448544

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. © 2013 ACM.

The data on this page was last updated at 05:14 on July 22, 2019.