Publikationen Tagungen Vorträge Datum  | Erscheinungsart  | Fachgebiet  | Autor  | Titel  A  | B  | C  | D  | E  | F  | G  | H  | I  | J  | K  | L  | M  | N  | O  | P  | R  | S  | T  | U  | V  | W  | Z  | ALLE

Autoren (E)  Ebner Thomas | Edelsbrunner Herbert | Effenberger Dietmar | Ehrenfeucht Andrzej | Ekhart C.W. | Eller Christian  Autor Jahr Publikation Ebner Thomas 1999 Design and Implementation of Interactive, Web based Courses Edelsbrunner Herbert 1979 Optimizing the dynamization of decomposable searching problems Edelsbrunner Herbert 1980 Dynamic rectangle intersection searching Edelsbrunner Herbert 1980 A time - and space - optimal solution for the planar all intersecting rectangle problem Edelsbrunner Herbert 1980 Dynamic data structures for orthogonal intersection queries Edelsbrunner Herbert 1980 On region location in the plane Edelsbrunner Herbert 1980 On the intersection of orthogonal objects Edelsbrunner Herbert 1981 Connected components of orthogonal geometrical objects Edelsbrunner Herbert 1981 A space optimal solution of general region location Edelsbrunner Herbert 1981 On the equivalence of some rectangle problems Edelsbrunner Herbert 1981 Polygonal intersection searching Edelsbrunner Herbert 1981 Graphics in flatland: a case study Edelsbrunner Herbert 1981 On average- and worst-case segment trees Edelsbrunner Herbert 1981 On the shape of a set of points in the plane Edelsbrunner Herbert 1981 Complexity classes for dynamic on-line searching involving intervals on line Edelsbrunner Herbert 1982 Intersection problems in computational geometry Edelsbrunner Herbert 1982 Stabbing line segments Edelsbrunner Herbert 1982 On the maximal number of edges of many faces in an arrangement Edelsbrunner Herbert 1982 Halfplanar range estimation Edelsbrunner Herbert 1982 On computing the extreme distances between two convex polygons Edelsbrunner Herbert 1982 Stabbing line segments Edelsbrunner Herbert 1982 Polygonal intersection searching Edelsbrunner Herbert 1982 On the intersection of orthogonal objects Edelsbrunner Herbert 1982 On the number of line-separations of a finite set in the plane Edelsbrunner Herbert 1983 Multidimensional data structures and algorithms, a bibliography Edelsbrunner Herbert 1983 Stationing guards in rectilinear art galleries Edelsbrunner Herbert 1983 Halfplanar range search in linear space and 0(n/0.695) query time Edelsbrunner Herbert 1983 Constructing arrangements of lines and hyperplanes with applications Edelsbrunner Herbert 1983 An optimal solution for searching in general planar subdivisions Edelsbrunner Herbert 1983 An optimal algorithm for constructing the weighted Voronoi diagram in the plane Edelsbrunner Herbert 1983 Some methods of computational geometry applied to computer graphics Edelsbrunner Herbert 1983 Efficient algorithms for agglomerative hierarchical clustering methods Edelsbrunner Herbert 1983 Batched dynamic solutions to decomposable searching problems Edelsbrunner Herbert 1984 Organizing points in two and three dimensions Edelsbrunner Herbert 1984 An improved algorithm for constructing k(th)-order Voronoi diagrams Edelsbrunner Herbert 1984 Dissecting sets of points in two and three dimensions Edelsbrunner Herbert 1984 Rectangular point location in d dimensions with applications Edelsbrunner Herbert 1984 Finding extreme points in three dimensions and solving the post-office problem in the plane Edelsbrunner Herbert 1984 Investigation of proportional link linkage clustering methods Edelsbrunner Herbert 1984 Optimal solutions for a class of point retrieval problems Edelsbrunner Herbert 1984 The complexity of cells in three-dimensional arrangements Edelsbrunner Herbert 1984 Constructing edge-skeletons in three dimensions with applications to power diagrams and dissecting three-dimensional point-sets Edelsbrunner Herbert 1984 The number of extreme pairs of finite point-sets in euclidean spaces Edelsbrunner Herbert 1985 Computing a ham-sandwich cut in two dimensions Edelsbrunner Herbert 1985 Finding extreme points in 3-space and solving the post-office problem in the plane Edelsbrunner Herbert 1985 Space searching for intersecting objects Edelsbrunner Herbert 1985 Linear space data structures for two types of range search Edelsbrunner Herbert 1986 Halfplanar range search in linear space and 0(n/0.695) query time Edelsbrunner Herbert 1986 Testing the necklace condition for shortest tours and optimal factors in the plane Effenberger Dietmar 1984 Text-Codierung für Bildschirmtext Ehrenfeucht Andrzej 1980 Continuous Grammars Ehrenfeucht Andrzej 1984 On total regulators generated by derivation relations Ekhart C.W. 1996 The Chemical Infobahn in Austria Eller Christian 1999 An Associative Repository for the Administration of Course Modules

		Sitemap	(2001-06-05 20:20:20)