Discrete and Computational Geometry
From MaRDI portal
Publication:5897091
DOI10.1007/b11261zbMath1179.52012OpenAlexW62175113MaRDI QIDQ5897091
Binay K. Bhattacharya, Asish Kumar Mukhopadhyay
Publication date: 5 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11261
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Length, area, volume and convex sets (aspects of convex geometry) (52A38)
Related Items (7)
An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest ⋮ Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance ⋮ Isoperimetric triangular enclosures with a fixed angle ⋮ Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares ⋮ Minimum-perimeter enclosures
This page was built for publication: Discrete and Computational Geometry
