On the public citation graph

Heuristics for minimum edge length rectangular partitions of rectilinear figures

https://doi.org/10.1007/bfb0036481
0 signed · 28 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/9781118555552.ch3openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf00288961openalex-snapshot
A fast algorithm for Steiner trees
inferredcites →https://doi.org/10.1007/bfb0012784openalex-snapshot
The power of non-rectilinear holes
inferredcites →https://doi.org/10.1109/dac.1982.1585541openalex-snapshot
The "PI" (Placement And Interconnect) System
inferredcites →https://doi.org/10.1109/sfcs.1976.16openalex-snapshot
Geometric intersection problems
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-306-47536-7_2openalex-snapshot
Guillotine Cut in Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/0-387-23830-1_7openalex-snapshot
Optimal Rectangular Partitions
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-61422-2_138openalex-snapshot
Linear-time heuristics for minimum weight rectangulation
inferred← citeshttps://doi.org/10.1007/978-3-031-10596-8_9openalex-snapshot
Restriction and Steiner Tree
inferred← citeshttps://doi.org/10.1007/bf01840375openalex-snapshot
Approximation algorithms for partitioning a rectangle with interior points
inferred← citeshttps://doi.org/10.1007/bf01840380openalex-snapshot
On heuristics for minimum length rectilinear partitions
inferred← citeshttps://doi.org/10.1007/bfb0036464openalex-snapshot
Theoretical Computer Science
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90013-2openalex-snapshot
On optimal guillotine partitions approximating optimal d-box partitions
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-044482537-7/50012-7openalex-snapshot
Polygon Decomposition
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101965openalex-snapshot
Rectangular partitions of a rectilinear polygon
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.035openalex-snapshot
Computing conforming partitions of orthogonal polygons with minimum stabbing number
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80042-2openalex-snapshot
Improved bounds for rectangular and guillotine partitions
inferred← citeshttps://doi.org/10.1090/fic/037/03openalex-snapshot
A tale on guillotine cut
inferred← citeshttps://doi.org/10.1109/glsv.1991.143947openalex-snapshot
On the generalized channel definition problem
inferred← citeshttps://doi.org/10.1145/10515.10526openalex-snapshot
Fast heuristics for minimum length rectangular partitions of polygons
inferred← citeshttps://doi.org/10.1145/234860.234865openalex-snapshot
Efficient decomposition of polygons into L-shapes with application to VLSI layouts
inferred← citeshttps://doi.org/10.1145/37401.37430openalex-snapshot
Rectangular convolution for fast filtering of characters
inferred← citeshttps://doi.org/10.1145/37402.37430openalex-snapshot
Rectangular convolution for fast filtering of characters
inferred← citeshttps://doi.org/10.1145/565196.565228openalex-snapshot
Picking alignments from (steiner) trees
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.