Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems

Mugurel Ionut Andreica(mugurelionutgmail.com)

Abstract: this paper I present several novel, efficient, algorithmic techniques for solving some multidimensional geometric data management and analysis problems. The techniques are based on several data structures from computational geometry (e.g. segment tree and range tree) and on the well-known sweep-line method.

Keywords: largest empty circle, largest empty hyper-rectangle, circle containment, hyper-rectangle containment, optimal subsequence

Category 1: Applications -- Science and Engineering (Data-Mining )

Category 2: Applications -- Science and Engineering (Facility Planning and Design )

Citation: Proceedings of the 3rd International Conference "Knowledge Management - Projects, Systems and Technologies", Bucharest, Romania, 23-25 October, 2008. (CD-ROM Proceedings) (ISBN: 978-606-505-124-9)

Download: [PDF]

Entry Submitted: 10/23/2008
Entry Accepted: 10/23/2008
Entry Last Modified: 10/23/2008

Modify/Update this entry