4 papers · 1 filter
An Algorithm for Solving the Smallest Enclosing Sphere Problem in the Presence of Degeneracies
Netzer Moriya
Efficient algorithms for solving the Smallest Enclosing Sphere (SES) problem, such as Welzl's algorithm, often fail to handle degenerate subsets of points in 3D space. Degeneracies…
Ill-Posed Configurations in Random and Experimental Data Points Collection
Netzer Moriya
Ill-posed configurations, such as collinear or coplanar point arrangements, are a persistent challenge in computational geometry, complicating tasks as in triangulation and convex…
The Largest Empty Sphere Problem in 3D Hollowed Point Clouds
Netzer Moriya
We introduce a new approach for the adaptation of the Maximal Internal Envelope method, extended to address the Largest Empty Sphere problem within unstructured 3D point clouds. We…
Form Convex Hull to Concavity: Surface Contraction Around a Point Set
Netzer Moriya
This paper investigates the transformation of a convex hull, derived from a d-dimensional point cloud, into a concave surface. Our primary focus is on the development of a methodol…