Efficient Computation of Elliptic Gabriel Graph

DOI10.1007/11751540_47zbMATH Open1162.68757OpenAlexW2169775121MaRDI QIDQ5505345FDOQ5505345

Authors: Changhee Lee, Hayong Shin, D. Kim, D.-S. Kim 

Publication date: 27 January 2009

Published in: Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11751540_47

Recommendations

• Trash removal algorithm for fast construction of the elliptic Gabriel graph using Delaunay triangulation
• scientific article; zbMATH DE number 4115994
• On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
• The expected size of some graphs in computational geometry
• Witness Gabriel graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (3)

• Convex hulls and metric Gabriel graphs
• Trash removal algorithm for fast construction of the elliptic Gabriel graph using Delaunay triangulation
• Title not available (Why is that?)

This page was built for publication: Efficient Computation of Elliptic Gabriel Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505345)