Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A hierarchical method for real-time distance computation among moving convex bodies

From MaRDI portal
Publication:1974624
Jump to:navigation, search

DOI10.1016/S0925-7721(99)00042-5zbMath0949.68156OpenAlexW2075726319MaRDI QIDQ1974624

Leonidas J. Guibas, David Hsu, L. Zhang

Publication date: 7 May 2000

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00042-5


zbMATH Keywords

hierarchical walk


Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)


Related Items

A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram ⋮ Representation complexity of adaptive 3D distance fields



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1974624&oldid=14431887"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 17:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki