Advanced search

Authors whose works are in public domain in at least one jurisdiction

List of works by Emo Welzl

1-50 of 81 results

epsilon-Nets and Simplex Range Queries

journal article from 'Discrete & Computational Geometry' published in 1987

Combinatorial Complexity Bounds for Arrangement of Curves and Spheres

journal article from 'Discrete & Computational Geometry' published in 1990

Smallest enclosing disks (balls and ellipsoids)

article

Quasi-Optimal Range Searching in Space of Finite VC-Dimension

journal article from 'Discrete & Computational Geometry' published in 1989

Constructing Belts in Two-Dimensional Arrangements with Applications

journal article from 'SIAM J. Comput.' published in 1986

Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time

journal article from 'Inf. Process. Lett.' published in 1986

On the maximal number of edges of many faces in an arrangement

journal article from 'J. Comb. Theory, Ser. A' published in 1986

Congruence, Similarity, and Symmetries of Geometric Objects

journal article from 'Discrete & Computational Geometry' published in 1988

Implicitly Representing Arrangements of Lines or Segments

journal article from 'Discrete & Computational Geometry' published in 1989

Stationing guards in rectilinear art galleries

journal article from 'Computer Vision, Graphics, and Image Processing' published in 1984

On the Number of Line Separations of a Finite Set in the Plane

journal article from 'J. Comb. Theory, Ser. A' published in 1985

Visibility graphs and obstacle-avoiding shortest paths

journal article from 'ZOR - Meth. & Mod. of OR' published in 1988

Euclidean minimum spanning trees and bichromatic closest pairs

journal article from 'Discrete & Computational Geometry' published in 1991

Constructing the Visibility Graph for n-Line Segments in O(n\(^2\)) Time

journal article from 'Inf. Process. Lett.' published in 1985

Fast Greedy Triangulation Algorithms

journal article from 'Comput. Geom.' published in 1997

A Subexponential Bound for Linear Programming

journal article from 'Algorithmica' published in 1996

The rank of sparse random matrices over finite fields

journal article from 'Random Struct. Algorithms' published in 1997

Simultaneous Inner and Outer Approximation of Shapes

journal article from 'Algorithmica' published in 1992

Color-Families are Dense

journal article from 'Theor. Comput. Sci.' published in 1982

Point-Line Incidences in Space

journal article from 'Combinatorics, Probability & Computing' published in 2004

Catching elephants with mice: Sparse sampling for monitoring sensor networks

journal article from 'TOSN' published in 2009

Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages

journal article from 'Acta Inf.' published in 1986

Discrepancy and approximations for bounded VC-dimension

journal article from 'Combinatorica' published in 1993

More on k-Sets of Finite Sets in the Plane

journal article from 'Discrete & Computational Geometry' published in 1986

On the Complexity of the General Coloring Problem

journal article from 'Information and Control' published in 1981

Improved Bounds on Weak epsilon-Nets for Convex Sets

journal article from 'Discrete & Computational Geometry' published in 1995

Symmetric graphs and interpretations

journal article from 'J. Comb. Theory, Ser. B' published in 1984

Approximation of convex figures by pairs of rectangles

journal article from 'Comput. Geom.' published in 1998

Polynomial graph-colorings

journal article from 'Discrete Applied Mathematics' published in 1992

Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems

journal article from 'Algorithmica' published in 1992

Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane

journal article from 'Theor. Comput. Sci.' published in 1989

Using String Languages to Describe Picture Languages

journal article from 'Information and Control' published in 1982

Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements

journal article from 'Discrete & Computational Geometry' published in 1994

Ranking intervals under visibility constraints∗

journal article from 'International Journal of Computer Mathematics' published in 1990

Shortest Paths for Line Segments

journal article from 'Algorithmica' published in 1993

Fat Triangles Determine Linearly Many Holes

journal article from 'SIAM J. Comput.' published in 1994

A Continuous Analogue of the Upper Bound Theorem

journal article from 'Discrete & Computational Geometry' published in 2001

Algorithms for center and Tverberg points

journal article from 'ACM Trans. Algorithms' published in 2008

Surface Reconstruction Between Simple Polygons via Angle Criteria

journal article from 'J. Symb. Comput.' published in 1994

Quantum technology: from research to application

journal article from 'Applied Physics B' published in 2016

One line and n points

journal article from 'Random Structures & Algorithms' published in 2003

Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes

journal article from 'Fundam. Inform.' published in 2003

On the Number of Crossing-Free Matchings, Cycles, and Partitions

journal article from 'SIAM J. Comput.' published in 2006

Online Conflict-Free Coloring for Intervals

journal article from 'SIAM J. Comput.' published in 2007

Space-Filling Curves and Their Use in the Design of Geometric Data Structures

journal article from 'Theor. Comput. Sci.' published in 1997

Order on Order Types

journal article from 'Discrete & Computational Geometry' published in 2018

The Bounded Degree Problem for NLC Grammars is Decidable

journal article from 'J. Comput. Syst. Sci.' published in 1986

Packing plane spanning trees and paths in complete geometric graphs

journal article from 'Inf. Process. Lett.' published in 2017

Stabbing Line Segments

journal article from 'BIT' published in 1982

On the number of crossing-free partitions

journal article from 'Comput. Geom.' published in 2013