The complexity of cutting complexes
From MaRDI portal
computational geometrycombinatorial geometryextremal functionspolynomial algorithmsconvex subdivisionthree-dimensional convex polytope
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Convex sets in (2) dimensions (including convex curves) (52A10) Other problems of combinatorial convexity (52A37) Convex sets in (3) dimensions (including convex surfaces) (52A15)
Recommendations
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- A convex 3-complex not simplicially isomorphic to a strictly convex complex
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Research Problems in Discrete Geometry
- Topologically sweeping an arrangement
Cited in
(27)- Moser's shadow problem
- Combinatorial configurations in balance layout optimization problems
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Optimized object packings using quasi-phi-functions
- Quasi-phi-functions and optimal packing of ellipses
- Optimized packing multidimensional hyperspheres: a unified approach
- Proportional packing of circles in a circular container
- Balance layout problem for 3D-objects: mathematical model and solution methods
- Packing ellipsoids in an optimized cylinder
- Optimized packing clusters of objects in a rectangular container
- Decomposition algorithm for irregular placement problems
- Sparsest balanced packing of irregular 3D objects in a cylindrical container
- Ray shooting in polygons using geodesic triangulations
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- Combinatorial optimization model of packing rectangles with stochastic parameters
- Stabbing convex subdivisions with \(k\)-flats
- Optimal clustering of a pair of irregular objects
- Monotone paths in planar convex subdivisions and polytopes
- Convex subdivisions with low stabbing numbers
- Packing ellipses in an optimized convex polygon
- The best ways to slice a polytope
- Compact representations of cuts
- Packing convex 3D objects with special geometric and balancing conditions
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- Complexity of projected images of convex subdivisions
- Complexity and behind the horizon cut off
- Shadows of Newton polytopes
This page was built for publication: The complexity of cutting complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115186)
