Eppstein, David
Overview
Works:  94 works in 167 publications in 1 language and 1,312 library holdings 

Genres:  Conference papers and proceedings Directories 
Roles:  Author, Editor 
Publication Timeline
.
Most widely held works by
David Eppstein
Media theory : interdisciplinary applied mathematics by
David Eppstein(
)
21 editions published between 2007 and 2008 in English and Undetermined and held by 525 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
21 editions published between 2007 and 2008 in English and Undetermined and held by 525 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 2225, 2009. Revised Papers by
David Eppstein(
)
19 editions published in 2010 in English and held by 474 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
19 editions published in 2010 in English and held by 474 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
JeanClaude Falmagne(
)
7 editions published in 2013 in English and held by 68 WorldCat member libraries worldwide
The book describes uptodate 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 EnglishSpanish 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 th
7 editions published in 2013 in English and held by 68 WorldCat member libraries worldwide
The book describes uptodate 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 EnglishSpanish 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 th
Forbidden configurations in discrete geometry by
David Eppstein(
)
6 editions published in 2018 in English and held by 62 WorldCat member libraries worldwide
This book surveys the mathematical and computational properties of finite sets of points in the plane, covering recent breakthroughs on important problems in discrete geometry, and listing many open problems. It unifies these mathematical and computational views using forbidden configurations, which are patterns that cannot appear in sets with a given property, and explores the implications of this unified view. Written with minimal prerequisites and featuring plenty of figures, this engaging book will be of interest to undergraduate students and researchers in mathematics and computer science. Most topics are introduced with a related puzzle or brainteaser. The topics range from abstract issues of collinearity, convexity, and general position to more applied areas including robust statistical estimation and network visualization, with connections to related areas of mathematics including number theory, graph theory, and the theory of permutation patterns. Pseudocode is included for many algorithms that compute properties of point sets.Provided by publisher
6 editions published in 2018 in English and held by 62 WorldCat member libraries worldwide
This book surveys the mathematical and computational properties of finite sets of points in the plane, covering recent breakthroughs on important problems in discrete geometry, and listing many open problems. It unifies these mathematical and computational views using forbidden configurations, which are patterns that cannot appear in sets with a given property, and explores the implications of this unified view. Written with minimal prerequisites and featuring plenty of figures, this engaging book will be of interest to undergraduate students and researchers in mathematics and computer science. Most topics are introduced with a related puzzle or brainteaser. The topics range from abstract issues of collinearity, convexity, and general position to more applied areas including robust statistical estimation and network visualization, with connections to related areas of mathematics including number theory, graph theory, and the theory of permutation patterns. Pseudocode is included for many algorithms that compute properties of point sets.Provided by publisher
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms by
David Eppstein(
)
4 editions published in 2002 in English and held by 31 WorldCat member libraries worldwide
4 editions published in 2002 in English and held by 31 WorldCat member libraries worldwide
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) by ALENEX(
)
2 editions published in 2015 in Undetermined and English and held by 22 WorldCat member libraries worldwide
2 editions published in 2015 in Undetermined and English and held by 22 WorldCat member libraries worldwide
Mesh generation and optimal triangulation by
Marshall Wayne Bern(
Book
)
3 editions published in 1992 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We survey the computational geometry relevant to finiteelement mesh generation. We especially focus on optimal triangulations of geometric domains in two and threedimensions. 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."
3 editions published in 1992 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We survey the computational geometry relevant to finiteelement mesh generation. We especially focus on optimal triangulations of geometric domains in two and threedimensions. 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."
Simultaneous strong separations of probabilistic and unambiguous complexity classes by
David Eppstein(
Book
)
2 editions published in 1990 in English and held by 6 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]."
2 editions published in 1990 in English and held by 6 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]."
Geometry in action(
)
in English and held by 6 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
in English and held by 6 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
Geometry Junkyard by
David Eppstein(
)
in English and held by 4 WorldCat member libraries worldwide
Provided by David Eppstein, professor of Information and Computer Science at the University of CaliforniaIrvine, the Geometry Junkyard is a metasite covering classical geometry theory and current research in the area of computer geometry, e.g. combination geometry, fractals, multidimensional 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
in English and held by 4 WorldCat member libraries worldwide
Provided by David Eppstein, professor of Information and Computer Science at the University of CaliforniaIrvine, the Geometry Junkyard is a metasite covering classical geometry theory and current research in the area of computer geometry, e.g. combination geometry, fractals, multidimensional 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
Maintenance of a minimum spanning forest in a dynamic planar graph(
Book
)
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We give efficient algorithms for maintaining a minimum spanning forest of a planar graph subject to online 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 edgeordered 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."
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We give efficient algorithms for maintaining a minimum spanning forest of a planar graph subject to online 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 edgeordered 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."
A deterministic linear time algorithm for geometric separators and its application by
David Eppstein(
Book
)
2 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We give a deterministic linear time algorithm for finding a 'good' sphere separator of a kply neighborhood system [phi] in any fixed dimension, where a kply 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 11/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 kply 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 kply 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 11/d])separator for a knearest neighborhood graph in d dimensions."
2 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We give a deterministic linear time algorithm for finding a 'good' sphere separator of a kply neighborhood system [phi] in any fixed dimension, where a kply 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 11/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 kply 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 kply 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 11/d])separator for a knearest neighborhood graph in d dimensions."
Parallel construction of quadtrees and quality triangulations by
Marshall Wayne Bern(
Book
)
2 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtreebased finite element meshes. Our algorithms take time O(log n) for point set input and O(log n log k) time for planar straightline graphs, using O(n+k/log n) processors, where n measures input size k output size."
2 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtreebased finite element meshes. Our algorithms take time O(log n) for point set input and O(log n log k) time for planar straightline graphs, using O(n+k/log n) processors, where n measures input size k output size."
New algorithms for minimummeasure simplices and onedimensional weighted Voronoi diagrams by
David Eppstein(
Book
)
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
Iterated nearest neighbors and finding minimal polytopes by
David Eppstein(
Book
)
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
Speedups in constructive solid geometry by
David Eppstein(
Book
)
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
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
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
Sparse dynamic programming(
Book
)
1 edition published in 1989 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 2 WorldCat member libraries worldwide
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 lowdimensional Euclidean geometry) meet some realworld 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
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 lowdimensional Euclidean geometry) meet some realworld 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
Approximation algorithms for geometric problems by Marshall Bern(
)
1 edition published in 1997 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1997 in English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Falmagne, JeanClaude Author Editor
 Ovchinnikov, Sergeĭ
 Gansner, Emden R. 1950 Editor
 Albert, Dietrich Editor
 Hu, Xiangen Editor
 Doble, Christopher Editor
 Brandes, Ulrik Editor
 Association for Computing Machinery
 ACM Digital Library
 Bern, Marshall Author
Associated Subjects
AlgebraData processing Algorithms Architecture Artificial intelligence Artificial intelligenceEducational applications Combinatorial analysis Combinatorial group theory Computational complexity Computer algorithms Computer graphics Computer programming Computer science Computer software Data structures (Computer science) Discrete geometry Distribution (Probability theory) Dynamic programming Education Educational tests and measurements Finite element method Geometrical constructions Geometrical models Geometry GeometryData processing Geometry in architecture Geometry in art Geometry in nature Grading and marking (Students) Graphic arts Graph theory Information theory Intelligent tutoring systems Mathematics MathematicsStudy and teaching Model theory Nets (Mathematics) Parallel processing (Electronic computers) Partitions (Mathematics) Probabilities Robotics ScienceData processing ScienceStudy and teaching Set theory Software engineering TeachingMethodology Web sites
Covers
Alternative Names
David Eppstein American computer scientist
David Eppstein Amerikaans wiskundige
David Eppstein USamerikanischer Informatiker und Mathematiker
Eppstein, D. 1963
Eppstein, David Arthur 1963
Languages