WorldCat Identities

Edelsbrunner, Herbert

Overview
Works: 157 works in 405 publications in 4 languages and 2,640 library holdings
Roles: Author, Other, Editor
Classifications: QA167, 516.13
Publication Timeline
.
Most widely held works by Herbert Edelsbrunner
Algorithms in combinatorial geometry by Herbert Edelsbrunner( Book )

18 editions published between 1987 and 1995 in 5 languages and held by 613 WorldCat member libraries worldwide

This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study
Geometry and topology for mesh generation by Herbert Edelsbrunner( Book )

25 editions published between 2001 and 2009 in English and held by 340 WorldCat member libraries worldwide

"The book combines topics in mathematics (geometry and topology), computer science (algorithms), and engineering (mesh generation). The original motivation for these topics was the difficulty faced (both conceptually and in technical execution) in any attempt to combine elements of combinatorial and numerical algorithms. Mesh generation is a topic in which a meaningful combination of these different approaches to problem solving is inevitable. The book develops methods from both areas that are amenable to combination and explains recent breakthrough solutions to meshing that fit into this category." "The book is an ideal graduate text for courses on mesh generation. The specific material is selected by giving preference to topics that are elementary, attractive, useful, and interesting and that lend themselves to teaching."--Reverso de la cubierta
Computational topology : an introduction by Herbert Edelsbrunner( Book )

12 editions published in 2010 in English and held by 323 WorldCat member libraries worldwide

"Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering." "The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department."--Jacket
A short course in computational geometry and topology by Herbert Edelsbrunner( Book )

13 editions published in 2014 in English and held by 43 WorldCat member libraries worldwide

With the aim to bring the subject of Computational Geometry and Topology closer to the scientific audience, this book is written in thirteen ready-to-teach sections organized in four parts: Tessellations, Complexes, Homology, Persistence. To speak to the non-specialist, detailed formalisms are often avoided in favor of lively 2- and 3-dimensional illustrations. The book is warmly recommended to everybody who loves geometry and the fascinating world of shapes
Topologically sweeping an arrangement by Herbert Edelsbrunner( Book )

6 editions published in 1986 in English and Undetermined and held by 29 WorldCat member libraries worldwide

Optimal point location in a monotone subdivision by Herbert Edelsbrunner( Book )

3 editions published in 1984 in English and held by 20 WorldCat member libraries worldwide

The complexity of many faces in arrangements of lines and segments by Herbert Edelsbrunner( Book )

5 editions published in 1988 in English and held by 19 WorldCat member libraries worldwide

An optimal algorithm for intersecting line segments in the plane by B Chazelle( Book )

3 editions published in 1988 in English and held by 17 WorldCat member libraries worldwide

Searching for empty convex polygons by David P Dobkin( Book )

4 editions published in 1988 in English and held by 16 WorldCat member libraries worldwide

Testing the necklace condition for shortest tours and optimal factors in the plane by Herbert Edelsbrunner( Book )

4 editions published in 1986 in English and German and held by 16 WorldCat member libraries worldwide

Persistence in discrete Morse theory by Ulrich Bauer( )

1 edition published in 2011 in English and held by 15 WorldCat member libraries worldwide

The goal of this thesis is to bring together two different theories about critical points of a scalar function and their relation to topology: Discrete Morse theory and Persistent homology. While the goals and fundamental techniques are different, there are certain themes appearing in both theories that closely resemble each other. In certain cases, the two threads can be joined, leading to new insights beyond the classical realm of one particular theory. Discrete Morse theory provides combinatorial equivalents of several core concepts of classical Morse theory, such as discrete Morse functions, discrete gradient vector fields, critical points, and a cancelation theorem for the elimination of critical points of a vector field. Because of its simplicity, it not only maintains the intuition of the classical theory but allows to surpass it in a certain sense by providing explicit and canonical constructions that would become quite complicated in the smooth setting
Ranking intervals under visibility constraints by Herbert Edelsbrunner( Book )

5 editions published in 1989 in 3 languages and held by 15 WorldCat member libraries worldwide

Computing median-of-squares regression lines and guided topological sweep by Herbert Edelsbrunner( Book )

4 editions published in 1988 in English and held by 14 WorldCat member libraries worldwide

The complexity of many cells in arrangements of planes and related problems by Herbert Edelsbrunner( Book )

3 editions published in 1988 in English and held by 14 WorldCat member libraries worldwide

Arrangements of curves in the plane : topology, combinatorics, and algorithms by Herbert Edelsbrunner( Book )

3 editions published in 1988 in English and held by 14 WorldCat member libraries worldwide

Tetrahedrizing point sets in three dimensions by Herbert Edelsbrunner( Book )

4 editions published in 1986 in English and held by 13 WorldCat member libraries worldwide

The complexity of cutting complexes by B Chazelle( Book )

4 editions published in 1987 in English and held by 13 WorldCat member libraries worldwide

Minimum polygonal separation by Herbert Edelsbrunner( Book )

2 editions published in 1986 in English and held by 12 WorldCat member libraries worldwide

Geometric algebra with applications in engineering by Christian Perwass( Book )

3 editions published in 2009 in English and held by 3 WorldCat member libraries worldwide

The application of geometric algebra to the engineering sciences is a young, active subject of research. The promise of this field is that the mathematical structure of geometric algebra together with its descriptive power will result in intuitive and more robust algorithms. This book examines all aspects essential for a successful application of geometric algebra: the theoretical foundations, the representation of geometric constraints, and the numerical estimation from uncertain data. Formally, the book consists of two parts: theoretical
Subdivision surfaces by Jörg Peters( )

2 editions published in 2008 in English and held by 1 WorldCat member library worldwide

Since their first appearance in 1974, subdivision algorithms for generating surfaces of arbitrary topology have gained widespread popularity in computer graphics and are being evaluated in engineering applications. This development was complemented by ongoing efforts to develop appropriate mathematical tools for a thorough analysis, and today, many of the fascinating properties of subdivision are well understood. This book summarizes the current knowledge on the subject. It contains both meanwhile classical results as well as brand-new, unpublished material, such as a new framework for constructing C 2-algorithms. The focus of the book is on the development of a comprehensive mathematical theory, and less on algorithmic aspects. It is intended to serve researchers and engineers - both new to the beauty of the subject - as well as experts, academic teachers and graduate students or, in short, anybody who is interested in the foundations of this flourishing branch of applied geometry
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.62 (from 0.48 for A short co ... to 0.93 for Persistenc ...)

Algorithms in combinatorial geometry
Alternative Names
Edelsbrunner, H.

Edelsbrunner, H. 1958-

Edelsbrunner, H. (Herbert)

Edelsbrunner, H. (Herbert), 1958-

Edelsbrunner, Herbert

Herbert Edelsbrunner American-Austrian computer scientist

Herbert Edelsbrunner austerriksk informatikar og matematikar

Herbert Edelsbrunner österreichischer Informatiker und Mathematiker

Herbert Edelsbrunner österrikisk datavetare och matematiker

Herbert Edelsbrunner østerriksk informatiker og matematiker

Herbert Edelsbrunner østrigsk informatiker og matematiker

Herbert Edelsbrunner wiskundige uit Oostenrijk

Languages
Covers
Geometry and topology for mesh generationComputational topology : an introductionGeometric algebra with applications in engineeringSubdivision surfaces