An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane

DOI10.1016/S0898-1221(98)00128-XzbMath0939.68146OpenAlexW1967868261MaRDI QIDQ1806579

Yanyan Li

Publication date: 27 June 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(98)00128-x

zbMATH Keywords

extreme verticesmoving convex polyhedron

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer aspects of numerical algorithms (65Y99)

Related Items

Collision detection algorithm of a continuous type using spherical extreme vertex diagrams, Balancing waveform relaxation for age-structured populations in a multilayer environment

Cites Work

• Solving related two- and three-dimensional linear programming problems in logarithmic time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item