A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
2007
Robotics: Science and Systems III
Preserved Fulltext
We present an efficient algorithm to compute the generalized penetration depth (PD g ) between rigid models. ...
We use global approaches to find an initial guess and present efficient techniques to compute a local approximation of the contact space for iterative refinement. ...
Lin and Stephane Redon for providing helpful discussions. ...
doi:10.15607/rss.2007.iii.034
dblp:conf/rss/ZhangKM07
fatcat:536aqzh5wzb2dczxjp64vbmbre
D-Plan: Efficient Collision-Free Path Computation for Part Removal and Disassembly
2008
Computer-Aided Design and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Design algorithms for a geometric proximity query -generalized penetration depth computation; • Develop efficient algorithms to improve the performance of sample-based motion planning for narrow passage ...
problems and CAD part disassembly applications; • Work for constrained motion interpolation for collision avoidance; • Develop efficient and practical algorithms for complete motion planning. ...
• Design algorithms for a geometric proximity query -generalized penetration depth computation; • Develop efficient algorithms to improve the performance of sample-based motion planning for narrow passage ...
doi:10.3722/cadaps.2008.774-786
fatcat:72nw4vrsbra6jpy6rwuwl7zvsu
Efficient Cell Labelling and Path Non-existence Computation using C-obstacle Query
2008
The international journal of robotics research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Research Assistant • Geometric algorithms for generalized penetration depth computation • Efficient motion planning algorithms for cluttered environments, constrained motion interpolation • Applications ...
to part disassembly, virtual prototyping and CAD/CAM • Practical algorithms for complete motion planning and path non-existence problem; global vector field computation for feedback motion planning • ...
Kim, Dinesh Manocha, A Simple and Fast Algorithm for Gen-
eralized Penetration Depth Computation, Robotics: Science and Systems Conference (RSS),
278-285, 2007
8. ...
doi:10.1177/0278364908099216
fatcat:vwba54vk5remxmjkhed2sxjw5u
A Fast Method for Local Penetration Depth Computation
2006
Journal of Graphics Tools
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Then, for each of these regions, we estimate a local penetration depth in the previously computed penetration direction. ...
depths: for any pair of intersecting objects, we partition the penetrating zones into coherent regions, and we determine for each of these regions a local penetration direction. ...
Otaduy for insightful discussions and his reviewing of a first version of this paper, and the reviewers for their thorough and useful comments on improving this paper. ...
doi:10.1080/2151237x.2006.10129216
fatcat:nim3icbzufchvlepjgdslmjgvy
Deformed Distance Fields for Simulation of Non-Penetrating Flexible Bodies
[chapter]
2001
Eurographics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We present a novel penetration depth estimation algorithm based on the use of deformed distance fields for simulation of non-penetrating flexible bodies. ...
Our approach can automatically handle self-penetration and inter-penetration in a uniform manner. ...
Acknowledgements We wish to thank Gentaro Hirota for the use of his simulator and his assistance in testing our algorithm, and the anonymous reviewers for their feedback. ...
doi:10.1007/978-3-7091-6240-8_10
fatcat:ed7vg6b7nndzrehg2dq4wfhgie
Fast and simple 2D geometric proximity queries using graphics hardware
2001
Proceedings of the 2001 symposium on Interactive 3D graphics - SI3D '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
distance, penetration depth, and contact points and normals. ...
We present a new approach for computing generalized proximity information of arbitrary 2D objects using graphics hardware. ...
ACKNOWLEDGEMENTS We thank the anonymous reviewers for their helpful suggestions. ...
doi:10.1145/364338.364383
fatcat:yq4cgafzvfeizghfz2azuyjt4a
Fast penetration depth estimation using rasterization hardware and hierarchical refinement
2003
Proceedings of the nineteenth conference on Computational geometry - SCG '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We present a novel and fast algorithm to estimate penetration depth (PD) between two polyhedral models. ...
It uses bounding volume hierarchies, model simplification, and culling algorithms to further accelerate the computation and refines the estimated PD in a hierarchical manner. ...
We will like to thank Kenneth Hoff, Miguel A. Otaduy, and Dan Halperin for useful discussions and applications of this algorithm to dynamic simulation and virtual prototyping. ...
doi:10.1145/777847.777856
fatcat:enrmga2iyjfnvjg22bshhu3mta
Fast penetration depth estimation using rasterization hardware and hierarchical refinement
2003
Proceedings of the nineteenth conference on Computational geometry - SCG '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We present a novel and fast algorithm to estimate penetration depth (PD) between two polyhedral models. ...
It uses bounding volume hierarchies, model simplification, and culling algorithms to further accelerate the computation and refines the estimated PD in a hierarchical manner. ...
We will like to thank Kenneth Hoff, Miguel A. Otaduy, and Dan Halperin for useful discussions and applications of this algorithm to dynamic simulation and virtual prototyping. ...
doi:10.1145/777792.777856
dblp:conf/compgeom/KimOLM03
fatcat:uy7n3maxkbcdrnucluxq7wtqdy
Fast Penetration Depth Estimation Using Rasterization Hardware and Hierarchical Refinement
[chapter]
2004
Springer Tracts in Advanced Robotics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We present a novel and fast algorithm to estimate penetration depth (PD) between two polyhedral models. ...
It uses bounding volume hierarchies, model simplification, and culling algorithms to further accelerate the computation and refines the estimated PD in a hierarchical manner. ...
We will like to thank Kenneth Hoff, Miguel A. Otaduy, and Dan Halperin for useful discussions and applications of this algorithm to dynamic simulation and virtual prototyping. ...
doi:10.1007/978-3-540-45058-0_30
fatcat:2jab7bocbzajnktwr5xwcrzloa
Fast penetration depth computation for physically-based animation
2002
Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation - SCA '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We present a novel and fast algorithm to compute penetration depth (PD) between two polyhedral models for physically-based animation. ...
We demonstrate its application to contact response computation and a time-stepping method for dynamic simulation. ...
N00014-01-1-0496, Intel and a fellowship of the Government of the Basque Country. ...
doi:10.1145/545265.545266
fatcat:c43zcmxpz5fmlglstehufacr7y
Fast penetration depth computation for physically-based animation
2002
Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation - SCA '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We present a novel and fast algorithm to compute penetration depth (PD) between two polyhedral models for physically-based animation. ...
We demonstrate its application to contact response computation and a time-stepping method for dynamic simulation. ...
N00014-01-1-0496, Intel and a fellowship of the Government of the Basque Country. ...
doi:10.1145/545261.545266
dblp:conf/sca/KimOLM02
fatcat:pbnzm3gupjdevmcxfjafqxafhy
Sensation-Preserving Haptic Rendering
2005
IEEE Computer Graphics and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments We thank Naga Govindaraju, Nitin Jain, and Avneesh Sud for their help on the GPU implementation and the University of North Carolina's Geometric Algorithms for Modeling, Motion, and Animation ...
(GAMMA) Group for helpful discussions about this work. ...
But, the computational bottleneck remains, and we need a way to compute the penetration depth and its gradient fast enough to perform 6-DOF haptic texture rendering. ...
doi:10.1109/mcg.2005.85
pmid:16060567
fatcat:dvlcxgwwtzchti6lafhnb3nlsa
Six-Degree-of-Freedom Haptic Rendering Using Incremental and Localized Computations
2003
Presence - Teleoperators and Virtual Environments
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
However, no general and efficient algorithms are known for computing penetration depth between polyhedral objects for haptic rendering. ...
., Rabinovitch, A., and Sharir, M. 2000. Penetration depth of two convex polytopes in 3D. Nordic J. Computing 7 , 227-240. Baraff, D. 1994. ...
In practice, they result in significant speed ups in contact force computation and PD estimation between general polytopes. ...
doi:10.1162/105474603765879530
fatcat:xuxt5mjgwfaahd52db6kxuncdm
A unified approach for physically-based simulations and haptic rendering
2009
Proceedings of the 2009 ACM SIGGRAPH Symposium on Video Games - Sandbox '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Abstract Based on our new geometric data structure, the inner sphere trees, we present fast and stable algorithms for different kinds of collision detection queries between rigid objects at haptic rates ...
Moreover, we present a time-critical version of the penetration volume computation that is able to achieve very tight bounds within a fixed budget of query time. ...
Acknowledgment This work was partially supported by DFG grant ZA292/1-1 and BMBF grant Avilus / 01 IM 08 001 U. ...
doi:10.1145/1581073.1581097
fatcat:zmu5jnayrrh77lvqfmtq46jbw4
Efficient collision detection for soft tissue simulation in a surgical planning system
2009
2009 11th IEEE International Conference on Computer-Aided Design and Computer Graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, therefore, an efficient collision detection method based on a new 3D signed distance field algorithm is proposed to accurately detect the contact positions and compute the penetration depth ...
The performance of the proposed collision detection algorithm has been improved in memory requirements and computational efficiency against the conventional methods. ...
Acknowledgment The research was supported by Shanghai Leading Academic Discipline Project (Project Number: S30602) and Shanghai Science Foundation of China (No. 08ZR1409300). ...
doi:10.1109/cadcg.2009.5246935
dblp:conf/cadgraphics/WangY09
fatcat:jv3l4ywewjc7ffmg27lk4usute
« Previous
Showing results 1 — 15 out of 35,898 results