###
DOI:
Journal of Software:1997.8(8):577-584

半动态矩形交查询算法
高静波,李新友,唐泽圣,周晓辉
(清华大学计算机科学与技术系CAD中心,北京,100084)
SEMI-DYNAMIC RECTANGLE INTERSECTION SEARCHING ALGORITHM
GAO Jingbo,LI Xinyou,TANG Zesheng,ZHOU Xiaohui
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3044   Download 2840
    Revised:September 16, 1996
> 中文摘要: 本文讨论了动态矩形交查询算法.文中介绍了两个半动态矩形查询的新算法,它们分别基于一维数据结构和二维数据结构.一维查询算法的查询时间复杂度是O(logMk′),更新时间复杂度是O(logMlogn),空间复杂度是OnlogM/).二维查询算法的查询时间复杂度是O(log2Mk),更新时间复杂度是O(log2Mlogn),空间复杂度是Onlog2M).本文分别实现了这两个算法,通过对它们的性能进行比较,发现一维查询算法是一种高效、实用的算法.
中文关键词: 计算几何  短形交查询  动态查询
Abstract:This paper introduces a solution to dynamic rectangle intersection searching problem.There are two semi-dynamic algorithms which are based on 1-dimensional data structure and 2-dimensional data structure respectively.The computational complexity Of 1-D searching algorithm is as follows:query time O(1ogM+k'),update time O(1ogMlogn),space O(nlogM).The computational complexity of 2-D searching algorithm is as follows:query time O(1og2M+k),update time O(1og2Mlogn),space O(nlog2M).The two algorithms are implemented respectively.With an experimental comparison,the authors found that 1-D searching algorithm is far better than 2-D searching algorithm.
文章编号:     中图分类号:    文献标志码:
基金项目:本文研究得到国家863高科技项目基金资助. 本文研究得到国家863高科技项目基金资助.
Foundation items:
Reference text:

高静波,李新友,唐泽圣,周晓辉.半动态矩形交查询算法.软件学报,1997,8(8):577-584

GAO Jingbo,LI Xinyou,TANG Zesheng,ZHOU Xiaohui.SEMI-DYNAMIC RECTANGLE INTERSECTION SEARCHING ALGORITHM.Journal of Software,1997,8(8):577-584