#### Filter Results:

- Full text PDF available (318)

#### Publication Year

1985

2017

- This year (14)
- Last 5 years (86)
- Last 10 years (167)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- David Eppstein
- SIAM J. Comput.
- 1994

We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest paths from a given source s to each vertex in the graph, in total… (More)

- Marshall W. Bern, David Eppstein, John R. Gilbert
- FOCS
- 1990

We study several versions of the problem of generating triangular meshes for finite element methods. We show how to triangulate a planar point set or polygonally bounded domain with triangles of bounded aspect ratio; how to triangulate a planar point set with triangles having no obtuse angles; how to triangulate a point set in arbitrary dimension with… (More)

We survey the computational geometry relevant to nite element mesh generation. We especially focus on optimal triangulations of geometric domains in twoand three-dimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some criterion that measures the size, shape, or number of triangles. We… (More)

We construct a graph on a planar point set, which captures its shape in the following sense: if a smooth curve is sampled densely enough, the graph on the samples is a polygonalization of the curve, with no extraneous edges. The required sampling density varies with the Local Feature Size on the curve, so that areas of less detail can be sampled less… (More)

- David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
- J. ACM
- 1997

We provide data strutures that maintain a graph as edges are inserted and deleted, and keep track of the following properties with the following times: minimum spanning forests, graph connectivity, graph 2-edge connectivity, and bipartiteness in time<italic>O</italic>(<italic>n</italic><supscrpt>1/2</supscrpt>) per change; 3-edge connectivity, in time… (More)

- David Eppstein
- J. Graph Algorithms Appl.
- 1995

We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic programming within each piece. The same methods can be used to solve other planar graph problems including connectivity,… (More)

- David Eppstein
- SIAM J. Comput.
- 1990

Natarajan reduced the problem of designing a certain type of mechanical parts orienter to that of finding reset sequences for monotonic deterministic finite automata. He gave algorithms that in polynomial time either find such sequences or prove that no such sequence exists. In this paper we present a new algorithm based on breadth first search that runs in… (More)

- David Eppstein
- 1996

We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.

- Nina Amenta, Marshall W. Bern, David Eppstein
- Graphical Models and Image Processing
- 1998

- David Eppstein
- Algorithmica
- 2000

It is known that any planar graph with diameter D has treewidth O(D) , and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show that treewidth is bounded by a function of the diameter in a minor-closed family, if and only if some apex graph does… (More)