On the public citation graph

Polygon Area Decomposition Using a Compactness Metric

https://doi.org/10.2139/ssrn.4459800
0 signed · 45 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.1007/11007937_4openalex-extracted
The CMA Evolution Strategy: A Comparing Review
inferredcites →https://doi.org/10.1007/3-540-12689-9_105openalex-extracted
Fast triangulation of simple polygons
inferredcites →https://doi.org/10.1007/3-540-13883-8_78openalex-extracted
Bounds on the length of convex partitions of polygons
inferredcites →https://doi.org/10.1007/3-540-32494-1_4openalex-extracted
The CMA Evolution Strategy: A Comparing Review
inferredcites →https://doi.org/10.1007/3-540-63307-3_69openalex-extracted
Dynamic data structures for fat objects and their applications
inferredcites →https://doi.org/10.1007/978-3-540-69355-0_13openalex-extracted
Equal-Area Locus-Based Convex Polygon Decomposition
inferredcites →https://doi.org/10.1007/978-3-540-87700-4_30openalex-extracted
A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity
inferredcites →https://doi.org/10.1007/bf00229299openalex-extracted
Optimal equi-partition of rectangular domains for parallel computation
inferredcites →https://doi.org/10.1007/bf01759065openalex-extracted
Finding a minimal cover for binary images: An optimal parallel algorithm
inferredcites →https://doi.org/10.1007/bf02187904openalex-extracted
Nonobtuse triangulation of polygons
inferredcites →https://doi.org/10.1007/bf02570715openalex-extracted
Linear-size nonobtuse triangulation of polygons
inferredcites →https://doi.org/10.1007/s43684-021-00009-9openalex-extracted
WARA-PS: a research arena for public safety demonstrations and autonomous collaborative rescue robotics experimentation
inferredcites →https://doi.org/10.1016/1049-9652(92)90076-aopenalex-extracted
An on-line algorithm for constrained Delaunay triangulation
inferredcites →https://doi.org/10.1016/j.comgeo.2005.10.005openalex-extracted
Approximate convex decomposition of polygons
inferredcites →https://doi.org/10.1016/j.jda.2005.06.008openalex-extracted
Area-preserving approximations of polygonal paths
inferredcites →https://doi.org/10.1016/j.tcs.2010.01.012openalex-extracted
Equal-area locus-based convex polygon decomposition
inferredcites →https://doi.org/10.1016/s0146-664x(72)80017-0openalex-extracted
An iterative procedure for the polygonal approximation of plane curves
inferredcites →https://doi.org/10.1016/s0925-7721(99)00059-0openalex-extracted
Dynamic data structures for fat objects and their applications
inferredcites →https://doi.org/10.1017/cbo9781107325074.003openalex-extracted
An Essay on the Application of Mathematical Analysis to the Theories of Electricity and Magnetism
inferredcites →https://doi.org/10.1063/1.3060521openalex-extracted
An Essay on the Application of Mathematical Analysis to the Theories of Electricity and Magnetism
inferredcites →https://doi.org/10.1080/13658816.2012.752093openalex-extracted
An efficient measure of compactness for two-dimensional shapes and its application in regionalization problems
inferredcites →https://doi.org/10.1109/access.2021.3134760openalex-extracted
Multi-Robot Workspace Division Based on Compact Polygon Decomposition
inferredcites →https://doi.org/10.1109/aero.2006.1656025openalex-extracted
Parallel Region Coverage Using Multiple UAVs
inferredcites →https://doi.org/10.1109/robot.1985.1087247openalex-extracted
Real-time obstacle avoidance for manipulators and mobile robots
inferredcites →https://doi.org/10.1109/sfcs.1983.34openalex-extracted
Minimum partition of polygonal regions into trapezoids
inferredcites →https://doi.org/10.1109/ssrr.2016.7784325openalex-extracted
Area coverage with heterogeneous UAVs using scan patterns
inferredcites →https://doi.org/10.1109/t-c.1975.224276openalex-extracted
Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
inferredcites →https://doi.org/10.1137/0214056openalex-extracted
Decomposing a Polygon into Simpler Components
inferredcites →https://doi.org/10.1142/s0218195998000230openalex-extracted
Polygon Area Decomposition for Multiple-Robot Workspace Division
inferredcites →https://doi.org/10.1145/129902.129906openalex-extracted
A generic solution to polygon clipping
inferredcites →https://doi.org/10.1145/5383.5387openalex-extracted
Partitioning a polygonal region into trapezoids
inferredcites →https://doi.org/10.1145/800135.804396openalex-extracted
Decomposing a polygon into its convex parts
inferredcites →https://doi.org/10.1163/156855307779293698openalex-extracted
Rectilinear workspace partitioning for parallel coverage using multiple unmanned aerial vehicles
inferredcites →https://doi.org/10.1177/027836498600500106openalex-extracted
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
inferredcites →https://doi.org/10.1177/1729881421989551openalex-extracted
Flight planning in multi-unmanned aerial vehicle systems: Nonconvex polygon area decomposition and trajectory assignment
inferredcites →https://doi.org/10.1179/000870494787073718openalex-extracted
Generating and mapping population density surfaces within a geographical information system
inferredcites →https://doi.org/10.1179/caj.1994.31.1.21openalex-extracted
inferredcites →https://doi.org/10.1287/moor.6.1.19openalex-extracted
Minimization by Random Search Techniques
inferredcites →https://doi.org/10.2139/ssrn.2936284openalex-extracted
The Third Criterion: Compactness as a Procedural Safeguard Against Partisan Gerrymandering
inferredcites →https://doi.org/10.2307/2109043openalex-extracted
A Note: Measuring Compactness as a Requirement of Legislative Apportionment
inferredcites →https://doi.org/10.24926/265535.2601openalex-extracted
Reapportionment, Gerrymanders, and the Notion of Compactness
inferredcites →https://doi.org/10.3138/fm57-6770-u75u-7727openalex-extracted
ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE
inferredcites →https://doi.org/10.3233/fi-1978-2114openalex-extracted
On two-dimensional data organization I1
inferredcites →https://doi.org/10.48550/arxiv.1609.04747openalex-extracted
An overview of gradient descent optimization algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5821/dissertation-2117-404667openalex-snapshot
Optimizing workspace division for multi-UAV 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.