On the public citation graph

Convex Decomposition and Simplification of a Polygon

https://doi.org/10.2139/ssrn.4789205
0 signed · 20 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rob.21928openalex-extracted
Decomposition‐based mission planning for fixed‐wing UAVs surveying in wind
inferredcites →https://doi.org/10.1016/0010-4485(92)90027-8openalex-extracted
Recognition of form features using convex decomposition
inferredcites →https://doi.org/10.1016/0196-6774(81)90019-5openalex-extracted
A linear algorithm for computing the visibility polygon from a point
inferredcites →https://doi.org/10.1016/j.cad.2012.10.032openalex-extracted
Fast approximate convex decomposition using relative concavity
inferredcites →https://doi.org/10.1016/j.cag.2012.03.018openalex-extracted
α-Decomposition of polygons
inferredcites →https://doi.org/10.1016/j.cagd.2008.05.003openalex-extracted
Approximate convex decomposition of polyhedra and its applications
inferredcites →https://doi.org/10.1016/j.comgeo.2005.10.005openalex-extracted
Approximate convex decomposition of polygons
inferredcites →https://doi.org/10.1016/j.cviu.2021.103243openalex-extracted
Near-convex decomposition of 2D shape using visibility range
inferredcites →https://doi.org/10.1016/j.ejor.2016.03.009openalex-extracted
Robust mixed-integer linear programming models for the irregular strip packing problem
inferredcites →https://doi.org/10.1016/j.ejor.2022.07.050openalex-extracted
An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
inferredcites →https://doi.org/10.1016/j.ejor.2023.08.009openalex-extracted
Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts
inferredcites →https://doi.org/10.1016/s0097-8493(97)00082-4openalex-extracted
A comparison of mesh simplification algorithms
inferredcites →https://doi.org/10.1016/s0377-2217(99)00033-8openalex-extracted
Algorithms for the decomposition of a polygon into convex polygons
inferredcites →https://doi.org/10.1080/10106049.2022.2055794openalex-extracted
Linear building pattern recognition in topographical maps combining convex polygon decomposition
inferredcites →https://doi.org/10.1109/38.920624openalex-extracted
A developer's survey of polygonal simplification algorithms
inferredcites →https://doi.org/10.1137/0214056openalex-extracted
Decomposing a Polygon into Simpler Components
inferredcites →https://doi.org/10.1145/3272127.3275029openalex-extracted
Approximate convex decomposition and transfer for animated meshes
inferredcites →https://doi.org/10.3390/ijgi9100594openalex-extracted
PolySimp: A Tool for Polygon Simplification Based on the Underlying Scaling Hierarchy
inferredcites →https://doi.org/10.3390/s19194165openalex-extracted
Convex Decomposition for a Coverage Path Planning for Autonomous Vehicles: Interior Extension of Edges
inferredcites →https://doi.org/10.3390/s23198178openalex-extracted
Polygon Simplification for the Efficient Approximate Analytics of Georeferenced Big Data
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.