Inscribed and circumscribed histogons of a convex polygon
Authors:
- Jaehoon ChungJCJaehoon Chung
- Sang Won BaeSBSang Won Bae
- Chan-Su ShinCSChan-Su Shin
- Sang Duk YoonSYSang Duk Yoon
- Hee-Kap AhnHAHee-Kap Ahn
- 20 November 2025
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 133
Abstract
No abstract availableFunding Information
- Pohang University of Science and Technology
- Institute of Information & Communications Technology Planning & Evaluation (2017-0-00905)
- Institute of Information & Communications Technology Planning & Evaluation (RS-2019-II191906)
- Ministry of Science and ICT, South Korea
- National Research Foundation of Korea (2018R1D1A1B07042755)
- National Research Foundation of Korea (RS-2023-00251168)
- National Research Foundation of Korea (RS-2023-00219980)
- National Research Foundation of Korea (2019R1F1A1058963)
This publication has 16 references indexed in Scilit:
- Largest triangles in a polygonComputational Geometry, 2021
- Maximum-area and maximum-perimeter rectangles in polygonsComputational Geometry, 2021
- Finding largest rectangles in convex polygonsComputational Geometry, 2016
- Aperture-Angle and Hausdorff-Approximation of Convex FiguresDiscrete & Computational Geometry, 2007
- Maximizing the area of an axially symmetric polygon inscribed in a simple polygonComputers & Graphics, 2007
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex setsComputational Geometry, 2006
- On the Computational Geometry of Pocket Machining1991
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- An optimal algorithm for finding minimal enclosing trianglesJournal of Algorithms, 1986
- A polynomial solution for the potato-peeling problemDiscrete & Computational Geometry, 1986