logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

DYNAMIC ALGORITHMS IN COMPUTATIONAL GEOMETRY

delete1992-01-01
delete82
PRE
AI
Y
Yi‐Jen Chiang
R
Roberto Tamassia
DOI：10.1109/5.163409delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Research on dynamic algorithms for geometric problems has received increasing attention in recent years, and is motivated by many important applications in circuit layout, computer graphics, and computer-aided design. In this paper we survey dynamic algorithms and data structures in the area of computational geometry. Our work has a twofold purpose: it introduces the area to the nonspecialist and reviews the state of the art for the specialist.
Keywords:
PLANAR POINT LOCATION
DECOMPOSABLE SEARCHING PROBLEMS
MAINTAINING RANGE TREES
CONVEX-HULL ALGORITHM
LOWER BOUNDS
RECTANGLE INTERSECTIONS
MONOTONE SUBDIVISION
SEGMENT INTERSECTION
SECONDARY MEMORY
TIME ALGORITHM
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Proceedings of the IEEE cover
Proceedings of the IEEE
IF:
25.9
Papers:
9.9K
Citations:
4.5W

Organization

No organization information available