On the public citation graph
Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
0 signed · 37 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.1002/net.3230130308openalex-snapshot
Finding a manhattan path and related problems
inferredcites →https://doi.org/10.1007/bfb0012784openalex-snapshot
The power of non-rectilinear holes
inferredcites →https://doi.org/10.1016/0020-0190(84)90105-4openalex-snapshot
An O(n log n) Manhattan path algorithm
inferredcites →https://doi.org/10.1016/0734-189x(84)90139-7openalex-snapshot
Minimal rectangular partitions of digitized blobs
inferredcites →https://doi.org/10.1137/0215033openalex-snapshot
Efficient Algorithms for Geometric Graph Search Problems
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.1002/malq.200510015openalex-snapshot
Minimum boundary touching tilings of polyominoes
inferred← citeshttps://doi.org/10.1007/0-387-23830-1_7openalex-snapshot
Optimal Rectangular Partitions
inferred← citeshttps://doi.org/10.1007/11896548_4openalex-snapshot
Spatio-temporal Aggregates over Streaming Geospatial Image Data
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-030-34029-2_1openalex-snapshot
Voronoi Diagram of Orthogonal Polyhedra in Two and Three Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-319-38851-9_21openalex-snapshot
A Merging Heuristic for the Rectangle Decomposition of Binary Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-97129-2_3openalex-snapshot
Avoiding Unreachable States
inferred← citeshttps://doi.org/10.1007/978-3-642-13818-8_6openalex-snapshot
Optimizing Query Processing in Cache-Aware Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_27openalex-snapshot
Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_34openalex-snapshot
Bundled Crossings in Embedded Graphs
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/pl00009346openalex-snapshot
Minimum Convex Partition of Polygonal Domains by Guillotine Cuts
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/s10288-022-00515-3openalex-snapshot
A hybrid heuristic for the rectilinear picture compression problem
inferred← citeshttps://doi.org/10.1007/s10878-024-01252-5openalex-snapshot
Recognizing integrality of weighted rectangles partitions
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50012-7openalex-snapshot
Polygon Decomposition
inferred← citeshttps://doi.org/10.1016/j.dam.2008.12.008openalex-snapshot
Optimal matrix-segmentation by rectangles
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.037openalex-snapshot
Approximation algorithms for decomposing octilinear polygons
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00125-3openalex-snapshot
On convex partitions of polygonal regions
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00203-4openalex-snapshot
Lower bounds for approximate polygon decomposition and minimum gap
inferred← citeshttps://doi.org/10.1016/s0020-0255(02)00167-6openalex-snapshot
Extracting compact fuzzy rules based on adaptive data approximation using B-splines
inferred← citeshttps://doi.org/10.1017/s0269964816000085openalex-snapshot
CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES
inferred← citeshttps://doi.org/10.1109/cira.2003.1222222openalex-snapshot
Part geometric understanding for tool path planning in additive manufacturing
inferred← citeshttps://doi.org/10.1109/iros.2003.1248977openalex-snapshot
Surface partitioning in automated CAD-guided tool planning for additive manufacturing
inferred← citeshttps://doi.org/10.1109/vtest.1994.292291openalex-snapshot
Fault probabilities in routing channels of VLSI standard cell designs
inferred← citeshttps://doi.org/10.1142/s0218195999000340openalex-snapshot
MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
inferred← citeshttps://doi.org/10.1142/s1793830910000863openalex-snapshot
EFFECT OF CORNER INFORMATION IN SIMULTANEOUS PLACEMENT OF k RECTANGLES AND TABLEAUX
inferred← citeshttps://doi.org/10.22430/22565337.1509openalex-snapshot
Diseño del encofrado para muros usando encofrados modulares
inferred← citeshttps://doi.org/10.5220/0002833900960103openalex-snapshot
DECOMPOSITION OF A 3D TRIANGULAR MESH INTO QUADRANGULATED PATCHES
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.