WorldCat Identities

Eppstein, David

Overview
Works: 71 works in 124 publications in 1 language and 1,058 library holdings
Genres: Conference proceedings  Directories 
Roles: Editor
Classifications: QA9.7, 511.34
Publication Timeline
Key
Publications about  David Eppstein Publications about David Eppstein
Publications by  David Eppstein Publications by David Eppstein
Most widely held works about David Eppstein
 
Most widely held works by David Eppstein
Media theory interdisciplinary applied mathematics by David Eppstein ( )
16 editions published between 2007 and 2008 in English and held by 478 WorldCat member libraries worldwide
"The focus of this book is a mathematical structure modeling a physical or biologist system that can be in any of a number of discrete states. Each state is characterized by just one of these features. The evolution of such a system over time is considered. This structure, which is called a 'medium, ' is investigated here from various standpoints: aglebraic, geometric, algorithmic, and probabilistic (stochastic)."--Jacket
Graph drawing 17th international symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009 : revised papers by David Eppstein ( )
12 editions published in 2010 in English and held by 399 WorldCat member libraries worldwide
This volume constitutes the refereed proceedings of the 17th International Symposium on Graph Drawing, GD 2009, held in Chicago, USA, during September 2009. The 31 revised full papers and 4 short papers presented were carefully reviewed and selected out of 79 submissions. Furthermore, 10 posters were accepted in a separate submission process
Knowledge spaces applications in education by Jean-Claude Falmagne ( )
4 editions published in 2013 in English and held by 48 WorldCat member libraries worldwide
The book describes up-to-date applications and relevant theoretical results. These applications come from various places, but the most important one, numerically speaking, is the internet based educational system ALEKS. The ALEKS system is bilingual English-Spanish and covers all of mathematics, from third grade to the end of high school, and chemistry. It is also widely used in higher education because US students are often poorly prepared when they reach the university level. The chapter by Taagepera and Arasasingham deals with the application of knowledge spaces, independent of ALEKS, to the teaching of college chemistry. The four chapters by Albert and his collaborators strive to give cognitive interpretations to the combinatoric structures obtained and used by the ALEKS system. The contribution by Eppstein is technical and develops means of searching the knowledge structure efficiently
Geometry in action ( )
in English and held by 9 WorldCat member libraries worldwide
Presents a directory of Web resources regarding real world applications of discrete and computational geometry, compiled by David Eppstein. Offers access to geometric reference and technique sites
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms by David Eppstein ( )
1 edition published in 2002 in English and held by 8 WorldCat member libraries worldwide
Mesh generation and optimal triangulation by Marshall Bern ( Book )
2 editions published in 1992 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We survey the computational geometry relevant to finite-element mesh generation. We especially focus on optimal triangulations of geometric domains in two- and 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 discuss algorithms both for the optimization of triangulations on a fixed set of vertices and for the placement of new vertices (Steiner points). We briefly survey the heuristic algorithms used in some practical mesh generators."
Graph drawing : 17th international symposium ; revised papers ( Book )
1 edition published in 2010 in English and held by 6 WorldCat member libraries worldwide
Simultaneous strong separations of probabilistic and unambiguous complexity classes by David Eppstein ( Book )
1 edition published in 1990 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We study the relationship between probabilistic and unambiguous computation, and provide strong relativized evidence that they are incomparable. In particular, we display a relativized world in which the complexity classes embodying these paradigms of computation are mutually immune. We answer questions formulated in -- and extend the line of research opened by -- Geske and Grollman [15] and Balcázar and Russo [3]."
Maintenance of a minimum spanning forest in a dynamic planar graph ( Book )
3 editions published in 1990 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We give efficient algorithms for maintaining a minimum spanning forest of a planar graph subject to on-line modifications. The modifications supported include changes in the edge weights, and insertion and deletion of edges and vertices. To implement the algorithms, we develop a data structure called an edge-ordered dynamic tree, which is a variant of the dynamic tree data structure of Sleator and Tarjan. Using this data structure, our algorithms run in O(log n) time per operation and O(n) space. The algorithms can be used to maintain the connected components of a dynamic planar graph in O(log n) time per operation."
Fully dynamic maintenance of euclidean minimum spanning trees by David Eppstein ( Book )
4 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
The geometry junkyard ( )
in English and held by 4 WorldCat member libraries worldwide
Provided by David Eppstein, professor of Information and Computer Science at the University of California-Irvine, the Geometry Junkyard is a metasite covering classical geometry theory and current research in the area of computer geometry, e.g. combination geometry, fractals, multi-dimensional geometry, problems (most of which are illustrated with diagrams). "These pages contain usenet clippings, web pointers, lecture notes, research excerpts, papers, abstracts, programs, problems and other stuff related to discrete and computational geometry
Iterated nearest neighbors and finding minimal polytopes by David Eppstein ( Book )
3 editions published between 1992 and 1993 in English and held by 3 WorldCat member libraries worldwide
Graph drawing revised papers ( )
1 edition published in 2010 in English and held by 3 WorldCat member libraries worldwide
A deterministic linear time algorithm for geometric separators and its application by David Eppstein ( Book )
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We give a deterministic linear time algorithm for finding a 'good' sphere separator of a k-ply neighborhood system [phi] in any fixed dimension, where a k-ply neighborhood system in R[superscript d] is a collection of n balls such that no points in the space is covered by more than k balls. The separating sphere intersects at most O(k[superscript 1/d]n[superscript 1-1/d] balls of [phi] and divides the remaining of [phi] into two parts: those in the interior and those in the exterior of the sphere, respectively, so that the larger part contains at most [delta]n balls ((d+1)/(d+2)<[delta]<1). This result improves the O(n²) time deterministic algorithm of Miller and Teng [30] and answers a major algorithmic open question posed by Miller, Teng, Thurston, and Vavasis [23, 26]. The deterministic algorithm hinges on the use of a new method for deriving the separator property of neighborhood systems. Using this algorithm, we devise an O(kn+n log n) time deterministic algorithm for computing the intersection graph of a k-ply neighborhood system. We give an O(n log n) time algorithm for constructing a linear space, O(log n) query time search structure for a geometric query problem associated with k-ply neighborhood systems, and we use this data structure in an algorithm for approximating the value of k within a constant factor in time O(n log n). We also develop a deterministic linear time algorithm for finding an O(k[superscript 1/d]n[superscript 1-1/d])-separator for a k-nearest neighborhood graph in d dimensions."
Geometry in action by David Eppstein ( )
in English and held by 2 WorldCat member libraries worldwide
Web Feet summary: This site has a collection of examples of applied geometry in a wide range of disciplines, from graphics to robotics to architecture. It collects various areas in which ideas from discrete and computational geometry (meaning mainly low-dimensional Euclidean geometry) meet some real-world applications. It also contains brief descriptions of those applications and the geometric questions arising from them, as well as pointers to Web pages on the applications themselves and on their geometric connections. The site is largely organized by application, but some major general techniques are also listed as topics. Although this site may be too advanced for some students, for others it may inspire greater interest in the study of geometry
Offline algorithms for dynamic minimum spanning tree problems by David Eppstein ( Book )
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
Subgraph isomorphism in planar graphs and related problems by David Eppstein ( Book )
2 editions published between 1994 and 1995 in English and held by 2 WorldCat member libraries worldwide
Graph drawing 17th international symposium, GD 2000, Chicago, IL, USA, September 22-25, 2009 : revised papers by Symposium on Graph Drawing ( )
1 edition published in 2010 in English and held by 2 WorldCat member libraries worldwide
Connectivity, graph minors, and subgraph multiplicity by David Eppstein ( Book )
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
Parallel construction of quadtrees and quality triangulations by Marshall Wayne Bern ( Book )
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for point set input and O(log n log k) time for planar straight-line graphs, using O(n+k/log n) processors, where n measures input size k output size."
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.72 (from 0.10 for Mary Eliza ... to 1.00 for Subgraph i ...)
Alternative Names
Eppstein, D. 1963-
Eppstein, David Arthur 1963-
Languages
English (62)
Covers