Closest point query among the union of convex polytopes using rasterization hardware

Authors:
Young J. Kim;Kenneth Hoff;Ming C. Lin;Dinesh Manocha
Affiliations:
Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina;Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina;Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina;Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina
Venue:
Journal of Graphics Tools - Special on hardware-accelerated rendering techniques
Year:
2002

Citing 6
Cited 1

Geometric and solid modeling: an introduction

Geometric and solid modeling: an introduction
The Union of Convex Polyhedra in Three Dimensions

SIAM Journal on Computing
Robot Motion Planning

Robot Motion Planning
Penetration depth of two convex polytopes in 3D

Nordic Journal of Computing
Fast penetration depth estimation using rasterization hardware and hierarchical refinement

Proceedings of the nineteenth annual symposium on Computational geometry
OpenGL(R) 1.4 Reference Manual (4th Edition)

OpenGL(R) 1.4 Reference Manual (4th Edition)

Fast penetration depth estimation using rasterization hardware and hierarchical refinement

Proceedings of the nineteenth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel approach using rasterization hardware to perform the following query: Given a collection of convex polytopes in 3D, find the closest point from some given point inside the polytopes to the surface of the union of the polytopes. The algorithm takes advantage of multipass rendering, clipping, and depth tests. We also demonstrate its application to penetration depth computation.