Point Location with Slab Decomposition

Speaker
Ron Yishai - Math Dept, Bar-Ilan
Date
04/11/2012 - 10:30Add to Calendar 2012-11-04 10:30:00 2012-11-04 10:30:00 Point Location with Slab Decomposition Point Location is a fundamental problem in Computational Geometry. Given a partition of the Euclidean space into disjoint areas, the problem faces the question: "In which area lies a given point?". This problem also reflects to world of data structure, because of the need to create a suitable structure that will keep the data and allow answering the question efficiently for any given point. We will introduce a method called Slab Decomposition which solves the problem in a simple and efficient way by using advanced search trees, called Persistent.  Moreover, we have programmed this method and approved it to be useful. אוניברסיטת בר-אילן - Department of Mathematics mathoffice@math.biu.ac.il Asia/Jerusalem public
Abstract

Point Location is a fundamental problem in Computational Geometry. Given a partition of the Euclidean space into disjoint areas, the problem faces the question: "In which area lies a given point?". This problem also reflects to world of data structure, because of the need to create a suitable structure that will keep the data and allow answering the question efficiently for any given point. We will introduce a method called Slab Decomposition which solves the problem in a simple and efficient way by using advanced search trees, called Persistent.  Moreover, we have programmed this method and approved it to be useful.

Last Updated Date : 31/10/2012