scientific article; zbMATH DE number 7384042
From MaRDI portal
Publication:5009355
zbMath1488.52019MaRDI QIDQ5009355
Publication date: 20 August 2021
Full work available at URL: http://elib.mi.sanu.ac.rs/files/journals/kjm/50/3_eng.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Graph representations (geometric and intersection representations, etc.) (05C62)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedra without diagonals
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Polyhedra without diagonals. II
- Triangulating a simple polygon in linear time
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Triangulating point sets in space
- Maximal triangulations of a regular prism
- Tetrahedrizing point sets in three dimensions
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- On 3-triangulation of toroids
- Convex polyhedra with triangular faces and cone triangulation
- Approximation for minimum triangulations of simplicial convex 3-polytopes