Art

J-GLOBAL ID：200902188163407982   Reference number：00A0447262

Discrete Mathematics and Its Applications. Another Proof of Polynomial-Time Recognizability of Delaunay Graphs.

Delaunayグラフの多項式時間認識可能性のもう一つの証明

Author (3)： HIROSHIMA T (Univ. Tokyo, Tokyo, JPN) ,  MIYAMOTO Y (Univ. Tokyo, Tokyo, JPN) ,  SUGIHARA K (Univ. Tokyo, Tokyo, JPN)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng))
Volume： E83-A  Issue： 4  Page： 627-638  Publication year： Apr. 25, 2000 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： Voronoi diagram ,...
Semi thesaurus term： topology

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=00A0447262&from=J-GLOBAL&jstjournalNo=F0699C") }}

JST classification (1)： Basics of graph theory  (IA02020S)

Reference (29)：

• AHO, A. V. The Design and Analysis of Computer Algorithms. 1974
• ASH, P. F. Recognizing Dirichlet tessellations. Geometriae Dedicata. 1985, 19, 175-206
• AURENHAMMER, R. Recognizing polytopical cell complexes and constructing projection polyhedra. Journal of Symbolic Computation. 1987, 3, 249-255
• AURENHAMMER, R. Voronoi diagram - A survey of a funcamental geometric data structure. ACM Computing Surveys. 1991, 23, 345-405
• DILLENCOURT, M. B. A non-Hamiltonian nondegenerate Delaunay triangulation. Information Processing Letters. 1987, 25, 149-151

Terms in the title (4)： グラフ ,  多項式時間 ,  可能性 ,  証明