2 papers
cs.CG2025
A Note on the Time Complexity of Using Subdivision Methods for the Approximation of Fibers
Michael M. Bilevich, Dan Halperin
Subdivision methods such as quadtrees, octrees, and higher-dimensional orthrees are standard practice in different domains of computer science. We can use these methods to represen…
cs.RO2024
Localization in Dynamic Planar Environments Using Few Distance Measurements
Michael M. Bilevich, Shahar Guini, Dan Halperin
We present a method for determining the unknown location of a sensor placed in a known 2D environment in the presence of unknown dynamic obstacles, using only few distance measurem…