Fast Hierarchical 3D Distance Transforms on the GPU

Cuntz, Nicolas; Kolb, Andreas

doi:10.2312/egs.20071042

Search citation statements

Order By: Relevance

Paper Sections

Select...

Bounded Distance Transforms1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2008

2020

Publication Types

Select...

Other3

Article3

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 10 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge, there is little on computing the bounds for distance fields. Schneider et al [195], Rong and Tan [188] and Cuntz and Kolb [38] compute approximate distance fields using GPU algorithms. They provide theoretical bounds on the computation of approximate distance transforms as compared to actual distance fields.…”

Section: Bounded Distance Transformsmentioning

confidence: 99%

Deep learning and GPU-accelerated algorithms for computer-aided engineering

Balu¹

View full text Add to dashboard Cite

Section: Bounded Distance Transformsmentioning

confidence: 99%

Deep learning and GPU-accelerated algorithms for computer-aided engineering

Balu¹

View full text Add to dashboard Cite

Generating signed distance fields on the GPU with ray maps

Krayer

2019

Vis Comput

View full text Add to dashboard Cite

Signed distance fields represent objects as distances to the closest surface points with a sign differentiating inside and outside. We present an algorithm to compute a signed distance field from triangle meshes. All data are kept on the GPU, making it ideal for any pure graphics-based context. We split the algorithm into a fast parallel distance transform and a new method of computing the sign. To determine the sign, we compute the winding number for any point using a ray map, a ray-based data structure that preserves geometric meaning while reducing the amount of work to be done for ray tests. Based on that structure, we devise a simple parallel algorithm to sample an exponentially growing number of rays to cope with meshes having deficiencies such as holes or self-intersections. We demonstrate how our method is both fast and able to handle imperfect meshes.

show abstract

A double layer method for constructing signed distance fields from triangle meshes

Jia-ju

Xie

2014

Graphical Models

View full text Add to dashboard Cite

Fast Hierarchical 3D Distance Transforms on the GPU

Cited by 10 publications

References 10 publications

Deep learning and GPU-accelerated algorithms for computer-aided engineering

Deep learning and GPU-accelerated algorithms for computer-aided engineering

Generating signed distance fields on the GPU with ray maps

A double layer method for constructing signed distance fields from triangle meshes

Contact Info

Product

Resources

About