On the public citation graph
Minimum area circumscribing Polygons
0 signed · 52 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0196-6774(85)90005-7openalex-snapshot
Finding the smallest triangles containing a given convex polygon
inferredcites →https://doi.org/10.1016/0196-6774(86)90007-6openalex-snapshot
An optimal algorithm for finding minimal enclosing triangles
inferredcites →https://doi.org/10.1016/0734-189x(83)90040-3openalex-snapshot
Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
inferredcites →https://doi.org/10.1016/0734-189x(85)90167-7openalex-snapshot
Counterexamples to a minimal circumscription algorithm
inferredcites →https://doi.org/10.1109/sfcs.1979.28openalex-snapshot
On a general method for maximizing and minimizing among certain geometric problems
inferredcites →https://doi.org/10.1109/sfcs.1984.715942openalex-snapshot
A Polynomial Solution For Potato-Peeling And Other Polygon Inclusion And Enclosure Problems
inferredcites →https://doi.org/10.1145/360881.360919openalex-snapshot
Determining the minimum-area encasing rectangle for an arbitrary closed curve
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1995.1039openalex-snapshot
An Improved Algorithm for the Traveler′s Problem
inferred← citeshttps://doi.org/10.1006/jagm.1996.0057openalex-snapshot
Enclosing a Set of Objects by Two Minimum Area Rectangles
inferred← citeshttps://doi.org/10.1007/3-540-18099-0_45openalex-snapshot
What can be parallelized in computational geometry?
inferred← citeshttps://doi.org/10.1007/3-540-44438-6_37openalex-snapshot
The Envelope of a Digital Curve Based on Dominant Points
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_279openalex-snapshot
An improved algorithm for the traveler's problem
inferred← citeshttps://doi.org/10.1007/978-981-96-4288-5_21openalex-snapshot
Budget-Aware Keyboardless Interaction
inferred← citeshttps://doi.org/10.1007/bf01840359openalex-snapshot
Geometric applications of a matrix-searching algorithm
inferred← citeshttps://doi.org/10.1007/bf02187692openalex-snapshot
A polynomial solution for the potato-peeling problem
inferred← citeshttps://doi.org/10.1007/s00022-013-0167-1openalex-snapshot
Isoperimetric triangular enclosures with a fixed angle
inferred← citeshttps://doi.org/10.1007/s00138-021-01191-9openalex-snapshot
Segmentation of photovoltaic module cells in uncalibrated electroluminescence images
inferred← citeshttps://doi.org/10.1007/s10998-023-00527-4openalex-snapshot
On the smallest area $$(n-1)$$-gon containing a convex n-gon
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00160-xopenalex-snapshot
Stock cutting to minimize cutting length
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90049-7openalex-snapshot
Finding minimal convex nested polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.02.002openalex-snapshot
Hausdorff approximation of convex polygons
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.017openalex-snapshot
An algorithm to find maximum area polygons circumscribed about a convex polygon
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.02.007openalex-snapshot
Minimum-perimeter enclosures
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.11.003openalex-snapshot
Finding the maximum bounded intersection of k out of n halfplanes
inferred← citeshttps://doi.org/10.1016/j.sysconle.2013.02.007openalex-snapshot
A hybrid model predictive control scheme for containment and distributed sensing in multi-agent systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.013openalex-snapshot
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
inferred← citeshttps://doi.org/10.1093/imrn/rnaf372openalex-snapshot
The Honeycomb Conjecture in Normed Planes and an Alpha-Convex Variant of a Theorem of Dowker
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/access.2020.3020981openalex-snapshot
Orbital Containment Control Algorithm and Complex Information Topology Design for Large-Scale Cluster of Spacecraft
inferred← citeshttps://doi.org/10.1109/cdc.2009.5400450openalex-snapshot
A hybrid model predictive control scheme for multi-agent containment and distributed sensing
inferred← citeshttps://doi.org/10.1109/icde.2018.00046openalex-snapshot
Improving Spatial Data Processing by Clipping Minimum Bounding Boxes
inferred← citeshttps://doi.org/10.1109/secon.1988.194879openalex-snapshot
Best regular enclosures for triangles
inferred← citeshttps://doi.org/10.1109/secon.1989.132366openalex-snapshot
Minimum enclosing rectangles: a comparative investigation of two optimizing criteria
inferred← citeshttps://doi.org/10.1109/secon.1991.147704openalex-snapshot
Minimum enclosing rectangles: a comparative investigation of two optimizing criteria (reprise)
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21966openalex-snapshot
Notes on searching in multidimensional monotone arrays
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267794openalex-snapshot
Computing a shortest k-link path in a polygon
inferred← citeshttps://doi.org/10.1111/1467-8659.00692openalex-snapshot
Solving Geometric Optimization Problems using Graphics Hardware
inferred← citeshttps://doi.org/10.1137/0221038openalex-snapshot
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
inferred← citeshttps://doi.org/10.1137/22m1482676openalex-snapshot
An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
inferred← citeshttps://doi.org/10.1142/s0218195900000267openalex-snapshot
EFFICIENT APPROXIMATION OF CONVEX POLYGONS
inferred← citeshttps://doi.org/10.1145/10515.10546openalex-snapshot
Geometric applications of a matrix searching algorithm
inferred← citeshttps://doi.org/10.1145/220279.220338openalex-snapshot
Minimal enclosing parallelogram with application
inferred← citeshttps://doi.org/10.1145/98524.98600openalex-snapshot
On solving geometric optimization problems using shortest paths
inferred← citeshttps://doi.org/10.1155/2021/6652342openalex-snapshot
Event-Triggered Adaptive Sliding Mode Attitude Containment Control for Microsatellite Cluster under Directed Graph
inferred← citeshttps://doi.org/10.1201/b10628-7openalex-snapshot
Computing a View Frustum to Maximize an Object’s Image Area
inferred← citeshttps://doi.org/10.4324/9781315471457-13openalex-snapshot
Approximation and Decomposition of Shapes
inferred← citeshttps://doi.org/10.48550/arxiv.2108.00326openalex-snapshot
On the smallest area $n-1$-gon containing a convex $n$-gon
inferred← citeshttps://doi.org/10.5753/jidm.2022.2519openalex-snapshot
A Systematic Review of Spatial Approximations in Spatial Database Systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.