Image de couverture de livre

Decoupling Geometry from Optimization in 2D Irregular Cutting and Packing Problems: an Open-Source Collision Detection Engine

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gardeyn, Jeroen, Berghe, Greet Vanden, Wauters, Tony
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry Robotics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

An open-source heuristic to reboot 2D nesting research
par: Gardeyn, Jeroen, et autres
Publié: (2025)

A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
par: Gardeyn, Jeroen, et autres
Publié: (2025)

Analytic Conditions for Differentiable Collision Detection in Trajectory Optimization
par: Jaitly, Akshay, et autres
Publié: (2025)

Polyhedral Collision Detection via Vertex Enumeration
par: Cinar, Andrew, et autres
Publié: (2025)

Co-design Optimization of Moving Parts for Compliance and Collision Avoidance
par: Mirzendehdel, Amir M., et autres
Publié: (2025)

INF-3DP: Implicit Neural Fields for Collision-Free Multi-Axis 3D Printing
par: Qu, Jiasheng, et autres
Publié: (2025)

Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space
par: Werner, Peter, et autres
Publié: (2024)

VF-Plan: Bridging the Art Gallery Problem and Static LiDAR Scanning with Visibility Field Optimization
par: Xiong, Biao, et autres
Publié: (2025)

Foam: A Tool for Spherical Approximation of Robot Geometry
par: Coumar, Sai, et autres
Publié: (2025)

Efficient Incremental Penetration Depth Estimation between Convex Geometries
par: Gao, Wei
Publié: (2023)

An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path Planning
par: Ibrahim, Ibrahim, et autres
Publié: (2024)

Ten Problems in Geobotics
par: Abrahamsen, Mikkel, et autres
Publié: (2024)

Implicit Swept Volume SDF: Enabling Continuous Collision-Free Trajectory Generation for Arbitrary Shapes
par: Wang, Jingping, et autres
Publié: (2024)

Learning the Contact Manifold for Accurate Pose Estimation During Peg-in-Hole Insertion of Complex Geometries
par: Negi, Abhay, et autres
Publié: (2025)

Distance and Collision Probability Estimation from Gaussian Surface Models
par: Goel, Kshitij, et autres
Publié: (2024)

Fast and Accurate Collision Probability Estimation for Autonomous Vehicles using Adaptive Sigma-Point Sampling
par: Cossette, Charles Champagne, et autres
Publié: (2025)

Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and Load Transferring
par: Garcia, Javier, et autres
Publié: (2022)

Exact Wavefront Propagation for Globally Optimal One-to-All Path Planning on 2D Cartesian Grids
par: Ibrahim, Ibrahim, et autres
Publié: (2024)

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
par: Zhou, Yi, et autres
Publié: (2026)

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
par: Mikula, Jan, et autres
Publié: (2025)

Non-planar 3D Printing of Double Shells
par: Mitropoulou, Ioanna, et autres
Publié: (2025)

Improved Wake-Up Time For Euclidean Freeze-Tag Problem
par: Alipour, Sharareh, et autres
Publié: (2025)

A Sublinear Algorithm for Path Feasibility Among Rectangular Obstacles
par: Fan, Alex, et autres
Publié: (2025)

Passage-traversing optimal path planning with sampling-based algorithms
par: Huang, Jing, et autres
Publié: (2025)

Morphing of and writing with a scissor linkage mechanism
par: A, Mohanraj, et autres
Publié: (2026)

TřiVis: Versatile, Reliable, and High-Performance Tool for Computing Visibility in Polygonal Environments
par: Mikula, Jan, et autres
Publié: (2024)

Theory and Explicit Design of a Path Planner for an SE(3) Robot
par: Zhang, Zhaoqi, et autres
Publié: (2024)

Spiral Complete Coverage Path Planning Based on Conformal Slit Mapping in Multi-connected Domains
par: Shen, Changqing, et autres
Publié: (2023)

Superfast Configuration-Space Convex Set Computation on GPUs for Online Motion Planning
par: Werner, Peter, et autres
Publié: (2025)

From axial C-hedra to general P-nets
par: Nawratil, Georg
Publié: (2024)

Certifying Bimanual RRT Motion Plans in a Second
par: Amice, Alexandre, et autres
Publié: (2023)

Rapid Vector-based Any-angle Path Planning with Non-convex Obstacles
par: Lai, Yan Kai
Publié: (2024)

Provable Methods for Searching with an Imperfect Sensor
par: Chakraborty, Nilanjan, et autres
Publié: (2024)

Reconfiguration and Locomotion with Joint Movements in the Amoebot Model
par: Padalkin, Andreas, et autres
Publié: (2023)

Accelerated Reeds-Shepp and Under-Specified Reeds-Shepp Algorithms for Mobile Robot Path Planning
par: Ibrahim, Ibrahim, et autres
Publié: (2025)

A Note on the Time Complexity of Using Subdivision Methods for the Approximation of Fibers
par: Bilevich, Michael M., et autres
Publié: (2025)

Omnidirectional Sensor Placement: A Large-Scale Computational Study and Novel Hybrid Accelerated-Refinement Heuristics
par: Mikula, Jan, et autres
Publié: (2024)

Towards Practical Finite Sample Bounds for Motion Planning in TAMP
par: Shaw, Seiji, et autres
Publié: (2024)

Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-offs
par: Farhana, Tsuri, et autres
Publié: (2026)

Construction and deformation of P-hedra using control polylines
par: Nawratil, Georg
Publié: (2025)