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-XzbMATH Open0939.68146OpenAlexW1967868261MaRDI QIDQ1806579FDOQ1806579

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 aspects of numerical algorithms (65Y99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving related two- and three-dimensional linear programming problems in logarithmic time

Cited In (2)

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

   Recommendations

• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra 👍 👎
• Collision detection algorithm of a continuous type using spherical extreme vertex diagrams 👍 👎
• A complete and efficient algorithm for the intersection of a general and a convex polyhedron 👍 👎
• An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window 👍 👎

This page was built for publication: An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806579)