On the public citation graph

The power of non-rectilinear holes

https://doi.org/10.1007/bfb0012784
0 signed · 115 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.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
inferredcites →https://doi.org/10.1109/sfcs.1976.16openalex-snapshot
Geometric intersection problems
inferredcites →https://doi.org/10.1109/tit.1983.1056648openalex-snapshot
Some NP-hard polygon decomposition problems
inferredcites →https://doi.org/10.1137/0211025openalex-snapshot
Planar Formulae and Their Uses
inferredcites →https://doi.org/10.1145/800076.802459openalex-snapshot
Convex decompositions of polyhedra
inferredcites →https://doi.org/10.1145/800135.804396openalex-snapshot
Decomposing a polygon into its convex parts
inferredcites →https://doi.org/10.3233/fi-1978-2114openalex-snapshot
On two-dimensional data organization I1

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-387-23830-1_7openalex-snapshot
Optimal Rectangular Partitions
inferred← citeshttps://doi.org/10.1007/11589440_9openalex-snapshot
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem
inferred← citeshttps://doi.org/10.1007/11785293_23openalex-snapshot
Approximation Algorithms for the Minimum Convex Partition Problem
inferred← citeshttps://doi.org/10.1007/11896548_4openalex-snapshot
Spatio-temporal Aggregates over Streaming Geospatial Image Data
inferred← citeshttps://doi.org/10.1007/11919476_55openalex-snapshot
Polyhedrization of Discrete Convex Volumes
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_110openalex-snapshot
The greedy and Delauney triangulations are not bad in the average case and minimum weight geometric triangulation of multi-connected polygons is NP-complete
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_78openalex-snapshot
Bounds on the length of convex partitions of polygons
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_28openalex-snapshot
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
inferred← citeshttps://doi.org/10.1007/3-540-52048-1_49openalex-snapshot
Robust decompositions of polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_33openalex-snapshot
Decomposing the boundary of a nonconvex polyhedron
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_38openalex-snapshot
Parallel triangulation of nonconvex polytopes
inferred← citeshttps://doi.org/10.1007/978-1-4612-2628-4_27openalex-snapshot
Decomposition Algorithms in Geometry
inferred← citeshttps://doi.org/10.1007/978-1-4615-5319-9_3openalex-snapshot
Minimum Convex Partitions of Polygonal Domains
inferred← citeshttps://doi.org/10.1007/978-3-031-23612-9_2openalex-snapshot
Rectangularization of Digital Objects and Its Relation with Straight Skeletons
inferred← citeshttps://doi.org/10.1007/978-3-319-16595-0_7openalex-snapshot
Computing Large Convex Regions of Obstacle-Free Space Through Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-45738-3_2openalex-snapshot
Partitioning Polygons via Graph Augmentation
inferred← citeshttps://doi.org/10.1007/978-3-540-78275-9_8openalex-snapshot
Scaling of Plane Figures That Assures Faithful Digitization
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_20openalex-snapshot
Convex Partitions with 2-Edge Connected Dual Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-15558-1_21openalex-snapshot
Articulation-Invariant Representation of Non-planar Shapes
inferred← citeshttps://doi.org/10.1007/978-3-642-19867-0_41openalex-snapshot
ACCORD: With Approximate Covering of Convex Orthogonal Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_20openalex-snapshot
Beyond Triangulation: Covering Polygons with Triangles
inferred← citeshttps://doi.org/10.1007/978-3-642-74575-1_13openalex-snapshot
Global Path Planning Approaches for Material Movements in a Worksite
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_38openalex-snapshot
MapSets: Visualizing Embedded and Clustered Graphs
inferred← citeshttps://doi.org/10.1007/bf01933206openalex-snapshot
On the minimality of polygon triangulation
inferred← citeshttps://doi.org/10.1007/bf02187807openalex-snapshot
Triangulating a nonconvex polytope
inferred← citeshttps://doi.org/10.1007/bf02189307openalex-snapshot
Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
inferred← citeshttps://doi.org/10.1007/bf02523191openalex-snapshot
Decomposing the boundary of a nonconvex polyhedron
inferred← citeshttps://doi.org/10.1007/bfb0009508openalex-snapshot
Minimum convex partition of a polygon with holes by cuts in given directions
inferred← citeshttps://doi.org/10.1007/bfb0036481openalex-snapshot
Heuristics for minimum edge length rectangular partitions of rectilinear figures
inferred← citeshttps://doi.org/10.1007/s00186-011-0356-3openalex-snapshot
Graph problems arising from parameter identification of discrete dynamical systems
inferred← citeshttps://doi.org/10.1007/s002240000101openalex-snapshot
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions
inferred← citeshttps://doi.org/10.1007/s00453-009-9329-9openalex-snapshot
Minimum Weight Convex Steiner Partitions
inferred← citeshttps://doi.org/10.1007/s10514-015-9479-3openalex-snapshot
Optimization-based locomotion planning, estimation, and control design for the atlas humanoid robot
inferred← citeshttps://doi.org/10.1007/s10878-010-9310-1openalex-snapshot
Convex partitions with 2-edge connected dual graphs
inferred← citeshttps://doi.org/10.1007/s11263-007-0057-9openalex-snapshot
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
inferred← citeshttps://doi.org/10.1007/s11750-008-0055-2openalex-snapshot
A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90028-5openalex-snapshot
A decision procedure for optimal polyhedron partitioning
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90207-xopenalex-snapshot
Rectangular partition is polynomial in two dimensions but NP-complete in three
inferred← citeshttps://doi.org/10.1016/0196-6774(82)90018-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50009-8openalex-snapshot
Optimal Convex Decompositions
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50012-8openalex-snapshot
Minimum Decompositions of Polygonal Objects
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50020-7openalex-snapshot
An Isothetic View of Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50012-7openalex-snapshot
Polygon Decomposition
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50023-1openalex-snapshot
Art Gallery and Illumination Problems
inferred← citeshttps://doi.org/10.1016/j.cag.2007.03.002openalex-snapshot
Point-in-polygon tests by convex decomposition
inferred← citeshttps://doi.org/10.1016/j.cag.2012.03.018openalex-snapshot
α-Decomposition of polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.10.005openalex-snapshot
Approximate convex decomposition of polygons
inferred← citeshttps://doi.org/10.1016/j.compenvurbsys.2017.08.008openalex-snapshot
Automated generation of versatile data model for analyzing urban architectural void
inferred← citeshttps://doi.org/10.1016/j.cviu.2012.08.017openalex-snapshot
Approximate partitioning of 2D objects into orthogonally convex components
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.022openalex-snapshot
Some theoretical challenges in digital geometry: A perspective
inferred← citeshttps://doi.org/10.1016/j.jda.2008.07.002openalex-snapshot
A fixed parameter algorithm for optimal convex partitions
inferred← citeshttps://doi.org/10.1016/j.patcog.2008.12.002openalex-snapshot
Digitization scheme that assures faithful reconstruction of plane figures
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00125-3openalex-snapshot
On convex partitions of polygonal regions
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00033-8openalex-snapshot
Algorithms for the decomposition of a polygon into convex polygons
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80022-3openalex-snapshot
Minimum K-partitioning of rectilinear polygons
inferred← citeshttps://doi.org/10.1017/cbo9780511546877.008openalex-snapshot
Combinatorial Motion Planning
inferred← citeshttps://doi.org/10.1080/10637199508915472openalex-snapshot
ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY
inferred← citeshttps://doi.org/10.1108/ec-09-2023-0617openalex-snapshot
Generation of adaptive refinement tetrahedral meshes over domains of multi-chamber partition
inferred← citeshttps://doi.org/10.1109/5.163407openalex-snapshot
Recent results in art galleries (geometry)
inferred← citeshttps://doi.org/10.1109/auv.1996.532450openalex-snapshot
A motion planning method for an AUV
inferred← citeshttps://doi.org/10.1109/cdc.2008.4739394openalex-snapshot
Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm
inferred← citeshttps://doi.org/10.1109/coase.2016.7743548openalex-snapshot
On minimizing turns in robot coverage path planning
inferred← citeshttps://doi.org/10.1109/cvpr.2014.529openalex-snapshot
Dual-Space Decomposition of 2D Complex Shapes
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00087openalex-snapshot
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
inferred← citeshttps://doi.org/10.1109/icra.2019.8793921openalex-snapshot
Safe and Fast Path Planning in Cluttered Environment using Contiguous Free-space Partitioning
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062094openalex-snapshot
Convex Partition of Sensor Networks and Its Use in Virtual Coordinate Geographic Routing
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195590openalex-snapshot
CONSEL: Connectivity-based segmentation in large-scale 2D/3D sensor networks
inferred← citeshttps://doi.org/10.1109/iros.2016.7759338openalex-snapshot
Delta DLP 3D printing with large size
inferred← citeshttps://doi.org/10.1109/sfcs.1983.34openalex-snapshot
Minimum partition of polygonal regions into trapezoids
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21976openalex-snapshot
Covering polygons is hard
inferred← citeshttps://doi.org/10.1109/tase.2017.2751664openalex-snapshot
Delta DLP 3-D Printing of Large Models
inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferred← citeshttps://doi.org/10.1109/tit.1983.1056648openalex-snapshot
Some NP-hard polygon decomposition problems
inferred← citeshttps://doi.org/10.1109/tnet.2011.2167758openalex-snapshot
Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach
inferred← citeshttps://doi.org/10.1109/tnet.2013.2289912openalex-snapshot
Connectivity-Based Segmentation in Large-Scale 2-D/3-D Sensor Networks: Algorithm and Applications
inferred← citeshttps://doi.org/10.1109/tro.2015.2459373openalex-snapshot
Homotopy-Based Divide-and-Conquer Strategy for Optimal Trajectory Planning via Mixed-Integer Programming
inferred← citeshttps://doi.org/10.1137/0213031openalex-snapshot
Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
inferred← citeshttps://doi.org/10.1137/0214056openalex-snapshot
Decomposing a Polygon into Simpler Components
inferred← citeshttps://doi.org/10.1137/0221025openalex-snapshot
Convex Decomposition of Polyhedra and Robustness
inferred← citeshttps://doi.org/10.1137/0402027openalex-snapshot
Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
inferred← citeshttps://doi.org/10.1137/1.9781611973730.96openalex-snapshot
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
inferred← citeshttps://doi.org/10.1137/24m171824xopenalex-snapshot
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
inferred← citeshttps://doi.org/10.1142/s0218195921500096openalex-snapshot
SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition
inferred← citeshttps://doi.org/10.1145/10515.10520openalex-snapshot
Minimally covering a horizontally convex orthogonal polygon
inferred← citeshttps://doi.org/10.1145/142675.142735openalex-snapshot
Minimum dissection of rectilinear polygon with arbitrary holes into rectangles
inferred← citeshttps://doi.org/10.1145/185675.185811openalex-snapshot
A single-exponential upper bound for finding shortest paths in three dimensions
inferred← citeshttps://doi.org/10.1145/1860093.1860116openalex-snapshot
Greedy geographic routing in large-scale sensor networks
inferred← citeshttps://doi.org/10.1145/2594772openalex-snapshot
Convex Partitioning of Large-Scale Sensor Networks in Complex Fields
inferred← citeshttps://doi.org/10.1145/304893.304933openalex-snapshot
Folding flat silhouettes and wrapping polyhedral packages
inferred← citeshttps://doi.org/10.1145/323233.323247openalex-snapshot
Decomposing polygonal regions into convex quadrilaterals
inferred← citeshttps://doi.org/10.1145/357337.357341openalex-snapshot
Triangulating Simple Polygons and Equivalent Problems
inferred← citeshttps://doi.org/10.1145/5383.5387openalex-snapshot
Partitioning a polygonal region into trapezoids
inferred← citeshttps://doi.org/10.1145/73833.73876openalex-snapshot
Triangulating a non-convex polytype
inferred← citeshttps://doi.org/10.1145/997817.997823openalex-snapshot
Approximate convex decomposition of polygons
inferred← citeshttps://doi.org/10.1145/997817.997889openalex-snapshot
Approximate convex decomposition
inferred← citeshttps://doi.org/10.1163/156855392x00268openalex-snapshot
View and route planning for patrol and exploring robots
inferred← citeshttps://doi.org/10.1177/02783649231201437openalex-snapshot
Certified polyhedral decompositions of collision-free configuration space
inferred← citeshttps://doi.org/10.1177/14780771251362413openalex-snapshot
Isovist graph generating method for structural expression of a floor plan
inferred← citeshttps://doi.org/10.1201/9780429055096-3openalex-snapshot
Creating High-Order Navigation Meshes through Iterative Wavefront Edge Expansions
inferred← citeshttps://doi.org/10.2174/1874110x01509010390openalex-snapshot
New Framework for Decomposing a Polygon with Zero or More Holes
inferred← citeshttps://doi.org/10.2478/s13537-014-0222-5openalex-snapshot
Infrastructure representation for container terminal simulation
inferred← citeshttps://doi.org/10.2514/6.2024-1204openalex-snapshot
Coverage Path Planning of a Drone-Tethered Boat for Bathymetry Mapping from Remote Sensing Imagery
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2008.01026openalex-snapshot
NP-Hardness of Some Polyhedral Mesh Decomposition Problems
inferred← citeshttps://doi.org/10.3929/ethz-a-007018092openalex-snapshot
Discrete Descriptions of Geometric Objects
inferred← citeshttps://doi.org/10.3929/ethz-b-000559974openalex-snapshot
Hardness and Approximation of Minimum Convex Partition
inferred← citeshttps://doi.org/10.5555/545381.545442openalex-snapshot
Slice and dice: a simple, improved approximate tiling recipe
inferred← citeshttps://doi.org/10.7155/jgaa.00364openalex-snapshot
MapSets: Visualizing Embedded and Clustered Graphs
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.