Computer Science – Computational Geometry
Scientific paper
2010-08-05
Computer Science
Computational Geometry
27 pages. JCCGG 2009
Scientific paper
Proximity graphs are used in several areas in which a neighborliness relationship for input data sets is a useful tool in their analysis, and have also received substantial attention from the graph drawing community, as they are a natural way of implicitly representing graphs. However, as a tool for graph representation, proximity graphs have some limitations that may be overcome with suitable generalizations. We introduce a generalization, witness graphs, that encompasses both the goal of more power and flexibility for graph drawing issues and a wider spectrum for neighborhood analysis. We study in detail two concrete examples, both related to Delaunay graphs, and consider as well some problems on stabbing geometric objects and point set discrimination, that can be naturally described in terms of witness graphs.
Aronov Boris
Dulieu Muriel
Hurtado Ferran
No associations
LandOfFree
Witness (Delaunay) Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Witness (Delaunay) Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Witness (Delaunay) Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-439173