Isoperimetric enclosures
From MaRDI portal
Elementary problems in Euclidean geometries (51M04) Length, area and volume in real or complex geometry (51M25) Convex sets in (2) dimensions (including convex curves) (52A10) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
Cites work
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Closed Forms: What They Are and Why We Care
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 47603 (Why is no real title available?)
- scientific article; zbMATH DE number 53705 (Why is no real title available?)
- scientific article; zbMATH DE number 3562002 (Why is no real title available?)
- scientific article; zbMATH DE number 1113630 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- Isoperimetric triangular enclosures with a fixed angle
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- On the Geometry of Piecewise Circular Curves
- On the Optimal Bisection of a Polygon
- The Complexity of Computing Steiner Minimal Trees
- The Isoperimetric Problem
- The isoperimetric problem on surfaces of revolution of decreasing Gauss curvature
- The Steiner tree problem
- Thin partitions, isoperimetric inequalities and a sampling algorithm for star shaped bodies
- VARIANTS OF A CLASSICAL ISOPERIMETRIC PROBLEM
- What is a Closed-Form Number?
This page was built for publication: Isoperimetric enclosures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345509)