7,457 research outputs found
Witness Gabriel Graphs
We consider a generalization of the Gabriel graph, the witness Gabriel graph.
Given a set of vertices P and a set of witnesses W in the plane, there is an
edge ab between two points of P in the witness Gabriel graph GG-(P,W) if and
only if the closed disk with diameter ab does not contain any witness point
(besides possibly a and/or b). We study several properties of the witness
Gabriel graph, both as a proximity graph and as a new tool in graph drawing.Comment: 23 pages. EuroCG 200
Witness gabriel graphs
We consider a generalization of the Gabriel graph, the witness Gabriel graph. Given a set of vertices P and a set of witness points W in the plane, there is an edge ab
between two points of P in the witness Gabriel graph (P,W) if and only if the
closed disk with diameter ab does not contain any witness point (besides possibly a
and/or b). We study several properties of the witness Gabriel graph, both as a proximity graph and as a new tool in graph drawing.Postprint (published version
Mutual Witness Proximity Drawings of Isomorphic Trees
A pair of graphs admits a mutual witness proximity
drawing when: (i) represents
, and (ii) there is an edge in if and only if there is
no vertex in that is ``too close'' to both and
(). In this paper, we consider infinitely many definitions of closeness
by adopting the -proximity rule for any and study
pairs of isomorphic trees that admit a mutual witness -proximity
drawing. Specifically, we show that every two isomorphic trees admit a mutual
witness -proximity drawing for any . The
constructive technique can be made ``robust'': For some tree pairs we can
suitably prune linearly many leaves from one of the two trees and still retain
their mutual witness -proximity drawability. Notably, in the special
case of isomorphic caterpillars and , we construct linearly separable
mutual witness Gabriel drawings.Comment: Appears in the Proceedings of the 31st International Symposium on
Graph Drawing and Network Visualization (GD 2023
Witness (Delaunay) Graphs
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.Comment: 27 pages. JCCGG 200
Interpretation, 1980 And 1880
This article reviews recent methodological interventions in the field of literary study, many of which take nineteenth-century critics, readers, or writers as models for their less interpretive reading practices. In seeking out nineteenth-century models for twenty-first-century critical practice, these critics imagine a world in which English literature never became a discipline. Some see these new methods as formalist, yet we argue that they actually emerge from historicist self-critique. Specifically, these contemporary critics view the historicist projects of the 1980s as overly influenced by disciplinary models of textual interpretation models that first arose, we show through our reading of the Jolly Bargemen scene in Charles Dickens\u27s Great Expectations (1860 61), in the second half of the nineteenth century. In closing, we look more closely at the work of a few recent critics who sound out the metonymic, adjacent, and referential relations between readers, texts, and historical worlds in order sustain historicism\u27s power to restore eroded meanings rather than reveal latent ones
- …