On the public citation graph
The complexity of cutting complexes
0 signed · 71 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.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1017/s0305004100057595openalex-snapshot
A convex 3-complex not simplicially isomorphic to a strictly convex complex
inferredcites →https://doi.org/10.1090/memo/0154openalex-snapshot
Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/800141.804663openalex-snapshot
On translating a set of rectangles
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11534273_23openalex-snapshot
Orthogonal Subdivisions with Low Stabbing Numbers
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_172openalex-snapshot
Ray shooting in polygons using geodesic triangulations
inferred← citeshttps://doi.org/10.1007/978-3-030-33585-4_21openalex-snapshot
Decomposition Algorithm for Irregular Placement Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-33585-4_27openalex-snapshot
Packing Convex 3D Objects with Special Geometric and Balancing Conditions
inferred← citeshttps://doi.org/10.1007/978-3-030-37618-5_14openalex-snapshot
Cutting Irregular Objects from the Rectangular Metal Sheet
inferred← citeshttps://doi.org/10.1007/978-3-030-48149-0_8openalex-snapshot
Optimized Packing of Object Clusters with Balancing Conditions
inferred← citeshttps://doi.org/10.1007/978-3-030-58124-4_11openalex-snapshot
Circular Layout in Thermal Deburring
inferred← citeshttps://doi.org/10.1007/978-3-031-34750-4_15openalex-snapshot
Modeling and Computer Simulation of Nanocomplexation for Cancer Therapy
inferred← citeshttps://doi.org/10.1007/978-3-031-34750-4_5openalex-snapshot
Intelligent Technology in Geometric Design
inferred← citeshttps://doi.org/10.1007/978-3-031-73324-6_35openalex-snapshot
A Heuristic Approach for Partial Covering Polyhedral Domains by Spheres
inferred← citeshttps://doi.org/10.1007/978-3-031-94630-1_8openalex-snapshot
Optimization of the Microstructure Design of Heat-Resistant Alloy Powders for Additive Manufacturing
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_6openalex-snapshot
Monotone Paths in Planar Convex Subdivisions and Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-319-18899-7_13openalex-snapshot
Optimized Object Packings Using Quasi-Phi-Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-41508-6_14openalex-snapshot
Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-68640-0_25openalex-snapshot
Placement Problems for Irregular Objects: Mathematical Modeling, Optimization and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_21openalex-snapshot
Monotone Paths in Planar Convex Subdivisions
inferred← citeshttps://doi.org/10.1007/bf01377183openalex-snapshot
Ray shooting in polygons using geodesic triangulations
inferred← citeshttps://doi.org/10.1007/s10559-015-9746-5openalex-snapshot
Balance Layout Problem for 3D-Objects: Mathematical Model and Solution Methods
inferred← citeshttps://doi.org/10.1007/s10559-018-0023-2openalex-snapshot
Combinatorial Configurations in Balance Layout Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10559-023-00544-8openalex-snapshot
Proportional Packing of Circles in a Circular Container
inferred← citeshttps://doi.org/10.1007/s10898-014-0192-0openalex-snapshot
Optimal clustering of a pair of irregular objects
inferred← citeshttps://doi.org/10.1007/s10898-015-0331-2openalex-snapshot
Quasi-phi-functions and optimal packing of ellipses
inferred← citeshttps://doi.org/10.1007/s10898-019-00777-yopenalex-snapshot
Packing ellipses in an optimized convex polygon
inferred← citeshttps://doi.org/10.1007/s10998-008-8217-7openalex-snapshot
Convex subdivisions with low stabbing numbers
inferred← citeshttps://doi.org/10.1007/s11856-023-2510-zopenalex-snapshot
Shadows of Newton polytopes
inferred← citeshttps://doi.org/10.1016/b978-0-323-89785-3.00008-6openalex-snapshot
Optimized designing spherical void structures in 3D domains
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.01.025openalex-snapshot
Packing of concave polyhedra with continuous rotations using nonlinear optimisation
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.01.051openalex-snapshot
Packing ellipsoids in an optimized cylinder
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.09.021openalex-snapshot
Sparsest balanced packing of irregular 3D objects in a cylindrical container
inferred← citeshttps://doi.org/10.1016/j.endm.2018.06.025openalex-snapshot
Stabbing convex subdivisions with k -flats
inferred← citeshttps://doi.org/10.1016/j.softx.2022.101241openalex-snapshot
SIC: An intelligent packing system with industry-grade features
inferred← citeshttps://doi.org/10.1023/a:1015648719133openalex-snapshot
Finding Specified Sections of Arrangements: 2D Results
inferred← citeshttps://doi.org/10.1057/jors.2015.94openalex-snapshot
Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization
inferred← citeshttps://doi.org/10.1080/00207543.2020.1755471openalex-snapshot
Sparsest packing of two-dimensional objects
inferred← citeshttps://doi.org/10.1080/01605682.2022.2039568openalex-snapshot
Sparse layout of irregular 3D clusters
inferred← citeshttps://doi.org/10.1109/acitt.2019.8780049openalex-snapshot
Balance Packing Problem of Cuboids in an Optimized Cylindrical Container
inferred← citeshttps://doi.org/10.1109/focs.2019.00057openalex-snapshot
Parametric Shortest Paths in Planar Graphs
inferred← citeshttps://doi.org/10.1109/lra.2022.3222996openalex-snapshot
Planning Irregular Object Packing via Hierarchical Reinforcement Learning
inferred← citeshttps://doi.org/10.1111/cgf.13490openalex-snapshot
Packing Irregular Objects in 3D Space via Hybrid Optimization
inferred← citeshttps://doi.org/10.1137/06066031xopenalex-snapshot
Axis-Aligned Subdivisions with Low Stabbing Numbers
inferred← citeshttps://doi.org/10.1145/1998196.1998263openalex-snapshot
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
inferred← citeshttps://doi.org/10.1145/220279.220308openalex-snapshot
Stabbing triangulations by lines in 3D
inferred← citeshttps://doi.org/10.1145/237218.237228openalex-snapshot
Shadows and slices of polytopes
inferred← citeshttps://doi.org/10.1155/2019/4136430openalex-snapshot
Optimized Packing Clusters of Objects in a Rectangular Container
inferred← citeshttps://doi.org/10.15407/pmach2016.03.043openalex-snapshot
Layout problems for arc objects in convex domains
inferred← citeshttps://doi.org/10.15587/1729-4061.2016.60847openalex-snapshot
Optimization of packing polyhedra in spherical and cylindrical containers
inferred← citeshttps://doi.org/10.15587/1729-4061.2018.140722openalex-snapshot
Development of the mathematical model and the method to solve a problem on the optimization of packing the ellipsoids into a convex container
inferred← citeshttps://doi.org/10.17169/refubium-7379openalex-snapshot
Computational aspects of some problems from discrete geometry in higher dimensions
inferred← citeshttps://doi.org/10.2118/217614-msopenalex-snapshot
Methodology of Creation of Artificial Core Reservoir Formations Using Geometric Design Methods
inferred← citeshttps://doi.org/10.2139/ssrn.6910998openalex-snapshot
Compact layout optimization of multiple components with specified geometries using a boundary-offset level set model
inferred← citeshttps://doi.org/10.2139/ssrn.6910999openalex-snapshot
Compact layout optimization of multiple components with specified geometries using a boundary-offset level set model
inferred← citeshttps://doi.org/10.2139/ssrn.7196897openalex-snapshot
The Multi-stage Column Generation for the Multi-size Three-Dimensional Bag Packing Problem in Last-mile Delivery
inferred← citeshttps://doi.org/10.26906/sunz.2018.2.048openalex-snapshot
УПАКОВКА МНОГОГРАННИКОВ В ВЫПУКЛЫЙ КОНТЕЙНЕР МИНИМАЛЬНОГО ОБЪЕМА
inferred← citeshttps://doi.org/10.32626/2308-5916.2019-19.126-131openalex-snapshot
Decomposition Algorithm for Optimization Placement Problems
inferred← citeshttps://doi.org/10.3390/ceramics6010038openalex-snapshot
Potentials of Numerical Methods for Increasing the Productivity of Additive Manufacturing Processes
inferred← citeshttps://doi.org/10.3934/mbe.2020344openalex-snapshot
Optimized packing multidimensional hyperspheres: a unified approach
inferred← citeshttps://doi.org/10.4018/ijmmme.344425openalex-snapshot
Estimating Porosity of Agglomerated Products Using Optimized Sphere Packing
inferred← citeshttps://doi.org/10.48550/arxiv.1111.5979openalex-snapshot
Erdős-Szekeres and Testing Weak epsilon-Nets are NP-hard in 3 dimensions - and what now?
inferred← citeshttps://doi.org/10.48550/arxiv.1811.05115openalex-snapshot
Parametric Shortest Paths in Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1906.08494openalex-snapshot
Object Placement on Cluttered Surfaces: A Nested Local Search Approach
inferred← citeshttps://doi.org/10.59254/sbpo-2020-122622openalex-snapshot
Nesting problems with continuous rotations: a survey
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.