Edelsbrunner, Herbert.
Edelsbrunner, Herbert, 1958-....
Herbert Edelsbrunner American-Austrian computer scientist
VIAF ID: 85219456 (Personal)
Permalink: http://viaf.org/viaf/85219456
Preferred Forms
- 200 _ | ââ¡a Edelsbrunnerâ ââ¡b Herbertâ ââ¡f 1958-....â
-
-
- 100 1 _ ââ¡a Edelsbrunner, Herbertâ
-
-
- 100 1 0 ââ¡a Edelsbrunner, Herbertâ
-
-
-
- 100 1 _ ââ¡a Edelsbrunner, Herbertâ
- 100 1 _ ââ¡a Edelsbrunner, Herbertâ ââ¡d 1958-â
- 100 1 _ ââ¡a Edelsbrunner, Herbertâ ââ¡d 1958-â
- 100 1 _ ââ¡a Edelsbrunner, Herbertâ ââ¡d 1958-...â
-
- 100 1 _ ââ¡a Edelsbrunner, Herbert,â ââ¡d 1958-....â
-
- 100 0 _ ââ¡a Herbert Edelsbrunnerâ ââ¡c American-Austrian computer scientistâ
Â
Â
Â
Â
4xx's: Alternate Name Forms (15)
5xx's: Related Names (6)
- 510 2 _ ââ¡a Institute of Science and Technology - Austriaâ
- 510 2 _ ââ¡a Institute of Science and Technology - Austriaâ ââ¡g Klosterneuburgâ ââ¡e Affiliationâ
- 510 2 _ ââ¡a Springer Science+Business Mediaâ
- 510 2 _ ââ¡a Springer-Verlag (Berlin)â
- 510 2 _ ââ¡a Technische Universität Grazâ
- 510 2 _ ââ¡a University of Waterloo. Department of Computer Scienceâ
Works
Title | Sources |
---|---|
An $O | |
3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture | |
Add isotropic Gaussian kernels at own risk | |
Algorithmic issues in modeling motion | |
Algorithms in combinatorial geometry | |
Combinatorial Complexity Bounds for Arrangement of Curves and Spheres | |
Comparison of pattern detection methods in microarray time series of the segmentation clock | |
The complexity of cutting complexes, 1987 | |
The complexity of many faces in arrangements of lines and segments | |
Computing Robustness and Persistence for Images | |
Computing the connected components of simple rectilinear geometrical objects in D-space | |
Constructing Belts in Two-Dimensional Arrangements with Applications | |
Counting and cutting cycles of lines and rods in space | |
Cutting dense point sets in half | |
DynamicRoots: A Software Platform for the Reconstruction and Analysis of Growing Plant Roots | |
Efficient algorithms for agglomerative hierarchical clustering methods | |
Euclidean minimum spanning trees and bichromatic closest pairs | |
Evaluating the quality of NMR structures by local density of protons | |
Experimental validation of the docking orientation of Cdc25 with its Cdk2-CycA protein substrate. | |
Extending Persistence Using Poincaré and Lefschetz Duality | |
Genotypic recognition and spatial responses by rice roots | |
Geometric Algebra with Applications in Engineering | |
Graphics in Flatland : a case study | |
Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time | |
Hierarchical ordering of reticular networks | |
Improved Bounds on Weak epsilon-Nets for Convex Sets | |
Kumiawase kikagaku no arugorizumu | |
Minimum polygonal separation | |
n86109710 | |
An O(n2log n) time algorithm for the MinMax angle triangulation | |
On arrangements of Jordan arcs with three intersections per pair | |
On the definition and the construction of pockets in macromolecules | |
On the Number of Line Separations of a Finite Set in the Plane | |
An optimal algorithm for intersecting line segments in the plane | |
Optimal Point Location in a Monotone Subdivision | |
The Persistent Homology of a Self-Map | |
Probing convex polygons with x-rays | |
Ranking intervals under visibility constraints | |
Searching for empty convex polygons | |
A Short Course in Computational Geometry and Topology | |
Stability of Persistence Diagrams | |
Stationing guards in rectilinear art galleries | |
Testing the necklace condition for shortest tours and optimal factors in the plane | |
Tetrahedrizing point sets in three dimensions | |
Three-dimensional alpha shapes | |
Time-varying Reeb graphs for continuous spaceâtime data | |
A topological hierarchy for functions on triangulated surfaces | |
Topologically sweeping an arrangement, 1986: | |
The weighted-volume derivative of a space-filling diagram | |
çµåãå¹¾ä½å¦ã®ã¢ã«ã´ãªãºã |