Sign inGet started
Paper · arXiv

Boundary Detection for High-Dimensional Point Clouds

We introduce two new methods for boundary detection in high-dimensional point cloud data, intended to work in situations with non-uniform density, high ambient dimension, and substantial noise. Our first method fits a separating hyperplane on local neighborhoods after doing local dimension reduction---this method works best when one can reliably estimate the intrinsic dimension of the data. Our second method measures the directional uniformity of local neighborhoods, and has the best overall performance on synthetic data. In addition to pointwise numerical boundary scores, our algorithms yield an estimated normal vector at each boundary point. We validate our methodology on synthetic data...

AuthorsAbigail Hickok, Valerio Galanti, Osama Al Dalahmah et al.
Primary categorycs.LG
Published16 October 2026
Last updated at source16 October 2026
cs.LGcs.CGstat.ML
Embed this entry
<iframe src="https://silytics.si/embed/item/c73ee4eb-8632-4113-a731-c248862d71c3" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 5 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 23 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.