DiFi: Fast 3D Distance Field Computation Using Graphics Hardware

ref: http://gamma.cs.unc.edu/DIFI/

DiFi: Fast 3D Distance Field Computation Using Graphics Hardware

 

by Avneesh Sud, Miguel A. Otaduy, and Dinesh Manocha.

(For more recent work: Fast Computation of Discrete Voronoi Diagrams and Distance Fields Using Graphics Hardware)

 

Paper

 

3D Distance Field of Hugo Model (17k polygons, Grid Size=73x45x128, Computation Time=4.2s). Distance to the surface is color coded, with distance increasing from red to green to blue. Medial Axis Transform of Triceratops Model (5.6k polygons, Grid Size=128x56x42, Computation Time=0.79s). The medial surface is color coded by the distance from the boundary.

 

We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the distance field for each slice of a uniform spatial grid by rasterizing the distance functions of the primitives. We compute bounds on the spatial extent of the Voronoi region of each primitive and use them cull away many distance functions for each slice. Moreover, we exploit spatial coherence between adjacent slices and perform incremental computations to speed up the computation. The combination of culling and clamping techniques results in rendering relatively few distance functions for each slice and reduces the load on the graphics pipeline. Our algorithm is applicable to all geometric models and does not make any assumptions about connectivity or a manifold representation. We have used our algorithm to compute distance fields of large models composed of tens of thousands of primitives on high resolution grids. Moreover, we demonstrate its application to medial axis evaluation and proximity computations. As compared to earlier approaches, we are able to achieve an order of magnitude improvement in the running time.

Keywords: Distance fields, Voronoi regions, graphics hardware, proximity computations

 

 

Contents

A. Sud, M. A. Otaduy and D. Manocha DiFi: Fast 3D Distance Field Computation Using Graphics Hardware. Computer Graphics Forum 23 (3): 557-566 (Proc. of Eurographics) 2004

A. Sud, and D. Manocha Fast Distance Field Computation Using Graphics Hardware. Tech Rep. TR03-026, Dept. of Computer Science, Univeristy of North Carolina, Chapel Hill, NC

Presentation: Presented at Proc. Eurogrpahics 2004, Grenoble, France.

 

 

Related Work at UNC

Fast Computation of Discrete Voronoi Diagrams and Distance Fields Using Graphics Hardware

Efficient Computation of a Simplified Medial Axis

Homotopy-Preserving Medial Axis Simplification

Constraint-Based Motion Planning for Virtual Prototyping

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值