#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1986

2019

- This year (4)
- Last 5 years (7)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- William J. Lenhart, Sue Whitesides
- Discrete & Computational Geometry
- 1995

Consider the problem of moving a closed chain ofn links in two or more dimensions from one given configuration to another. The links have fixed lengths and may rotate about their endpoints, possibly… (More)

- William J. Lenhart, Richard Pollack, +6 authors Chee-Keng Yap
- Symposium on Computational Geometry
- 1987

The link center of a simple polygon P is the set of points x inside P at which the maximal link-distance from x to any other point in P is minimized, where the link distance between two points x, y… (More)

- Prosenjit Bose, William J. Lenhart, Giuseppe Liotta
- Algorithmica
- 1996

Complete characterizations are given for those trees that can be drawn as either the relative neighborhood graph, relatively closest graph, Gabriel graph, or modified Gabriel graph of a set of points… (More)

- David Bremner, William S. Evans, +6 authors Sue Whitesides
- Graph Drawing
- 2012

We consider contact representations of graphs where vertices are represented by cuboids, i.e. interior-disjoint axis-aligned boxes in 3D space. Edges are represented by a proper contact between the… (More)

- Prosenjit Bose, Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta
- Graph Drawing
- 1994

This paper examines an infinite family of proximity drawings of graphs called open and closed ß-drawings, first defined by Kirkpatrick and Radke [15, 21] in the context of computational morphology.… (More)

- William S. Evans, Michael Kaufmann, William J. Lenhart, Tamara Mchedlidze, Stephen K. Wismath
- J. Graph Algorithms Appl.
- 2014

- William J. Lenhart, Giuseppe Liotta
- Graph Drawing
- 1996

- Vasek Chvátal, William J. Lenhart, Najiba Sbihi
- J. Comb. Theory, Ser. B
- 1990

We show that there are, up to a trivial equivalence, precisely six theorems of the following form: If the vertices of a graph G are coloured red and white in such a way that no chordless path with… (More)

- Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang
- Comput. Geom.
- 2009

In this paper we study various geometric predicates for determining the ex ist nce of and categorizing the configurations of lines in 3D that are transversal to lines or segments. We compu te the… (More)