首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Witness (Delaunay) graphs
Authors:Boris Aronov  Muriel Dulieu  Ferran Hurtado
Institution:1. Department of Computer Science and Engineering, Polytechnic Institute of NYU, Brooklyn, NY 11201, USA;2. Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Barcelona, Spain
Abstract: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.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号