Affordable Access

Publisher Website

Direct dynamic structures for some line segment problems

Authors
Journal
Computer Vision Graphics and Image Processing
0734-189X
Publisher
Elsevier
Publication Date
Volume
23
Issue
2
Identifiers
DOI: 10.1016/0734-189x(83)90111-1

Abstract

Abstract Simple direct dynamic binary tree structures for two line segment problems are introduced. Both structures provide for O(log n) updating and querying and can be based on any balanced class of binary search trees, for example, AVL trees. The measure tree solves a nondecomposable searching problem, while the stabbing tree improves the known updating and querying time for its corresponding application.

There are no comments yet on this publication. Be the first to share your thoughts.