Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees (Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• Persistent data structures, introduced by Sarnak and Tarjan, have been found especially useful in designing geometric algorithms. In this paper, we present a persistent form of binary-binary search tree, and then apply this data structure to solve various geometric searching problems, such as, three dimensional ray-shooting, hidden surface removal, polygonal point enclosure searching and so on. In all applications, we are able to either improve existing bounds or establish new bounds.

• 社団法人電子情報通信学会の論文
• 1994-04-25

著者

• Hirata Tomio

  Faculty Of Engineering Nagoya University

• Inagaki Yasuyoshi

  Faculty Of Engineering Nagoya University

• Tan Xuehou

  School of High-Technology for Human Welfare, Tokai University

• Tan X

  Tokai Univ. Numazu‐shi Jpn

• INAGAKI Yasuyoshi

  School of High-Technology for Human Welfare, Tokai University

• TAN Xuehou

  Faculty of Engineering, Nagoya University

関連論文

• Robust Dependency Parsing of Spontaneous Japanese Spoken Language(Speech Corpora and Related Topics, Corpus-Based Speech Technologies)
• Example-Based Query Generation for Spontaneous Speech
• Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees (Special Section on Discrete Mathematics and Its Applications)
• Confluence Property of Simple Frames in Dynamic Term Rewriting Calculus
• Azim: Direction-Based Service System for Both Indoors and Outdoors(Application, Ubiquitous Networks)

スポンサーリンク