Herbert Edelsbrunner

According to our database1, Herbert Edelsbrunner authored at least 232 papers between 1981 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Poisson-Delaunay Mosaics of Order k.
Discret. Comput. Geom., 2019

The Weighted Mean Curvature Derivative of a Space-Filling Diagram.
CoRR, 2019

The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.
CoRR, 2019

Holes and dependences in an ordered complex.
Comput. Aided Geom. Des., 2019

Topological Data Analysis in Information Space.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
On the Optimality of the FCC Lattice for Soft Sphere Packing.
SIAM J. Discret. Math., 2018

Topological data analysis with Bregman divergences.
J. Comput. Geom., 2018

Multiple covers with balls I: Inclusion-exclusion.
Comput. Geom., 2018

Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

The Multi-cover Persistence of Euclidean Balls.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Persistence in sampled dynamical systems faster.
CoRR, 2017

The Voronoi functional is maximized by the Delaunay triangulation in the plane.
Comb., 2017

2016
The classification of endoscopy images with persistent homology.
Pattern Recognit. Lett., 2016

Multiple Covers with Balls II: Weighted Averages.
Electron. Notes Discret. Math., 2016

2015
The Persistent Homology of a Self-Map.
Found. Comput. Math., 2015

Triangulations from topologically correct digital Voronoi diagrams.
Comput. Geom., 2015

Relaxed Disk Packing.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Stable Length Estimates of Tube-Like Shapes.
J. Math. Imaging Vis., 2014

The Classification of Endoscopy Images with Persistent Homology.
Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

The Geometry and Topology of Data Analysis.
Proceedings of the DATA 2014, 2014

The Morse Theory of Čech and Delaunay Filtrations.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.
Discret. Comput. Geom., 2013

Persistent Homology in Image Processing.
Proceedings of the Graph-Based Representations in Pattern Recognition, 2013

3D kinetic alpha complexes and their implementation.
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2012
A point calculus for interlevel set homology.
Pattern Recognit. Lett., 2012

Dual Complexes of Cubical Subdivisions of ℝ n.
Discret. Comput. Geom., 2012

The Medusa of Spatial Sorting: 3D Kinetic Alpha Complexes and Implementation
CoRR, 2012

The Medusa of Spatial Sorting: Topological Construction
CoRR, 2012

The Adaptive Topology of a Digital Image.
Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012

Alexander duality for functions: the persistent behavior of land and water and shore.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2011
Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.
Trans. Comput. Sci., 2011

Computing elevation maxima by searching the gauss sphere.
ACM J. Exp. Algorithmics, 2011

Quantifying Transversality by Measuring the Robustness of Intersections.
Found. Comput. Math., 2011

Letter from the New Editors-in-Chief.
Discret. Comput. Geom., 2011

Homology and Robustness of Level and Interlevel Sets
CoRR, 2011

Detailed reconstruction of 3D plant root shape.
Proceedings of the IEEE International Conference on Computer Vision, 2011

Diffusion runs low on persistence fast.
Proceedings of the IEEE International Conference on Computer Vision, 2011

Covering and Packing with Spheres by Diagonal Distortion in ℝ<sup><i>n</i></sup>.
Proceedings of the Rainbow of Computer Science, 2011

The Stability of the Apparent Contour of an Orientable 2-Manifold.
Proceedings of the Topological Methods in Data Analysis and Visualization, 2011

2010
Computing Robustness and Persistence for Images.
IEEE Trans. Vis. Comput. Graph., 2010

Lipschitz Functions Have <i>L</i><sub><i>p</i></sub>-Stable Persistence.
Found. Comput. Math., 2010

Persistent Homology under Non-uniform Error.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

The Robustness of Level Sets.
Proceedings of the Algorithms, 2010

Mean-Payoff Automaton Expressions.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Computational Topology - an Introduction.
American Mathematical Society, ISBN: 978-0-8218-4925-5, 2010

2009
Extending Persistence Using Poincaré and Lefschetz Duality.
Found. Comput. Math., 2009

Persistent homology for kernels, images, and cokernels.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

The Persistent Morse Complex Segmentation of a 3-Manifold.
Proceedings of the Modelling the Physiological Human, 3D Physiological Human Workshop, 2009

Stability and Computation of Medial Axes - a State-of-the-Art Report.
Proceedings of the Mathematical Foundations of Scientific Visualization, 2009

2008
Time-varying Reeb graphs for continuous space-time data.
Comput. Geom., 2008

Reeb spaces of piecewise linear mappings.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008


2007
Inequalities for the Curvature of Curves and Surfaces.
Found. Comput. Math., 2007

Stability of Persistence Diagrams.
Discret. Comput. Geom., 2007

Inclusion-Exclusion Formulas from Independent Complexes.
Discret. Comput. Geom., 2007

Alpha-Beta Witness Complexes.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

An introduction to persistent homology.
Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, 2007

Weak witnesses for Delaunay triangulations of submanifolds.
Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, 2007

Inferring Local Homology from Sampled Stratified Spaces.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
Interface surfaces for protein-protein complexes.
J. ACM, 2006

Extreme Elevation on a 2-Manifold.
Discret. Comput. Geom., 2006

Persistence-sensitive simplification functions on 2-manifolds.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Vines and vineyards by updating persistence in linear time.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Surface Tiling with Differential Topology.
Proceedings of the Third Eurographics Symposium on Geometry Processing, 2005

Extraction and Simplification of Iso-surfaces in Tandem.
Proceedings of the Third Eurographics Symposium on Geometry Processing, 2005

Coarse and Reliable Geometric Alignment for Protein Docking.
Proceedings of the Biocomputing 2005, 2005

Session Introduction: Biogeometry: Applications of Computational Geometry to Molecular Structure.
Proceedings of the Biocomputing 2005, 2005

2004
Biological applications of computational topology.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Simplification of Three-Dimensional Density Maps.
IEEE Trans. Vis. Comput. Graph., 2004

A Topological Hierarchy for Functions on Triangulated Surfaces.
IEEE Trans. Vis. Comput. Graph., 2004

Loops in Reeb Graphs of 2-Manifolds.
Discret. Comput. Geom., 2004

The Area Derivative of a Space-Filling Diagram.
Discret. Comput. Geom., 2004

Computing the Writhing Number of a Polygonal Knot.
Discret. Comput. Geom., 2004

Local Search Heuristic for Rigid Protein Docking.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Local and Global Comparison of Continuous Functions.
Proceedings of the 15th IEEE Visualization Conference, 2004

Time-varying reeb graphs for continuous space-time data.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Hierarchical Morse - Smale Complexes for Piecewise Linear 2-Manifolds.
Discret. Comput. Geom., 2003

Area, perimeter and derivatives of a skin curve.
Comput. Geom., 2003

A Multi-Resolution Data Structure for 2-Dimensional Morse Functions.
Proceedings of the 14th IEEE Visualization Conference, 2003

Morse-smale complexes for piecewise linear 3-manifolds.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Area and Perimeter Derivatives of a Union of Disks.
Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002
Sink Insertion for Mesh Improvement.
Int. J. Found. Comput. Sci., 2002

Fast Software for Box Intersections.
Int. J. Comput. Geom. Appl., 2002

An Experimental Study of Sliver Exudation.
Eng. Comput., 2002

Topological Persistence and Simplification.
Discret. Comput. Geom., 2002

Algorithmic issues in modeling motion.
ACM Comput. Surv., 2002

Relaxed Scheduling in Dynamic Skin Triangulation.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Element Quality and Tetrahedral Meshes (Invited Talk).
Proceedings of the 11th International Meshing Roundtable, 2002

2001
180 Wrapped Tubes.
J. UCS, 2001

Dynamic Skin Triangulation.
Discret. Comput. Geom., 2001

Design and analysis of planar shape deformation.
Comput. Geom., 2001

Shape space from deformation.
Comput. Geom., 2001

Computing Linking Numbers of a Filtration.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

Hierarchical morse complexes for piecewise linear 2-manifolds.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Geometry and Topology for Mesh Generation.
Cambridge monographs on applied and computational mathematics 7, Cambridge University Press, ISBN: 978-0-521-68207-7, 2001

2000
Sliver exudation.
J. ACM, 2000

Adaptive Simplicial Grids from Cross-Sections of Monotone Complexes.
Int. J. Comput. Geom. Appl., 2000

Edgewise Subdivision of a Simplex.
Discret. Comput. Geom., 2000

Smoothing and cleaning up slivers.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Deformable Smooth Surface Design.
Discret. Comput. Geom., 1999

Emerging Challenges in Computational Topology
CoRR, 1999

Mesh Association: Formulation and Algorithms.
Proceedings of the 8th International Meshing Roundtable, 1999

1998
On the Definition and the Construction of Pockets in Macromolecules.
Discret. Appl. Math., 1998

Shape Reconstruction with Delaunay Complex.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

Wrapping 3D Scanning Data.
Proceedings of the Conference on Three-Dimensional Image Capture and Applications, 1998

1997
Triangulating Topological Spaces.
Int. J. Comput. Geom. Appl., 1997

Cutting Dense Point Sets in Half.
Discret. Comput. Geom., 1997

Inclusion - Exclusion Complexes for Pseudodisk Collections.
Discret. Comput. Geom., 1997

A Combinatorial Approach to Cartograms.
Comput. Geom., 1997

Auditory Morse Analysis of Triangulated Manifolds.
Proceedings of the Mathematical Visualization, Algorithms, Applications and Numerics, 1997

1996
Triangulating the Surface of a Molecule.
Discret. Appl. Math., 1996

Viewing geometric protein structures from inside a CAVE.
IEEE Computer Graphics and Applications, 1996

Incremental Topological Flipping Works for Regular Triangulations.
Algorithmica, 1996

Lines in Space: Combinatorics and Algorithms.
Algorithmica, 1996

Geometric modeling in CAVE.
Proceedings of the ACM Symposium on Virtual Reality Software and Technology, 1996

1995
The Union of Balls and Its Dual Shape.
Discret. Comput. Geom., 1995

Improved Bounds on Weak epsilon-Nets for Convex Sets.
Discret. Comput. Geom., 1995

An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere.
Comput. Aided Geom. Des., 1995

Measuring proteins and voids in proteins.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

Smooth Surfaces for Multi-Scale Shape Representation.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Algebraic Decompositions of Non-Convex Polyhedra.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Three-dimensional alpha shapes.
ACM Trans. Graph., 1994

Selecting Heavily Covered Points.
SIAM J. Comput., 1994

Counting Triangle Crossing and Halving Planes.
Discret. Comput. Geom., 1994

Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains.
Algorithmica, 1994

Ray Shooting in Polygons Using Geodesic Triangulations.
Algorithmica, 1994

Modeling with Simplicial Complexes.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Computational Geometry.
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Computational Geometry.
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

A Quadratic Time Algorithm for the Minimax Length Triangulation.
SIAM J. Comput., 1993

On the Zone Theorem for Hyperplane Arrangements.
SIAM J. Comput., 1993

Computing a Face in an Arrangement of Line Segments and Related Problems.
SIAM J. Comput., 1993

An Upper Bound for Conforming Delaunary Triangulations.
Discret. Comput. Geom., 1993

Diameter, Width, Closest Line Pair, and Parametric Searching.
Discret. Comput. Geom., 1993

Edge Insertion for Optimal Triangulations.
Discret. Comput. Geom., 1993

Counting Triangle Crossings and Halving Planes.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

An Incremental Algorithm for Betti Numbers of Simplicial Complexes.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms.
Theor. Comput. Sci., 1992

An O(n<sup>2</sup> log n) Time Algorithm for the Minmax Angle Triangulation.
SIAM J. Sci. Comput., 1992

An Optimal Algorithm for Intersecting Line Segments in the Plane.
J. ACM, 1992

Optimal Time Bounds for Some Proximity Problems in the Plane.
Inf. Process. Lett., 1992

The number of edges of many faces in a line segment arrangement.
Comb., 1992

Edge Insertion for Optional Triangulations.
Proceedings of the LATIN '92, 1992

An Upper Bound for Conforming Delaunay Triangulations.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications.
Theor. Comput. Sci., 1991

An O(n log² h) Time Algorithm for the Three-Dimensional Convex Hull Problem.
SIAM J. Comput., 1991

A lower bound on the number of unit distances between the vertices of a convex polygon.
J. Comb. Theory, Ser. A, 1991

Corrigendum: Topologically Sweeping an Arrangement.
J. Comput. Syst. Sci., 1991

Points and Triangles in the Plane and Halving Planes in Space.
Discret. Comput. Geom., 1991

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Discret. Comput. Geom., 1991

Counting and Cutting Cycles of Lines and Rods in Space.
Comput. Geom., 1991

Computing a Face in an Arrangement of Line Segments.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Optimal Triangulations by Retriangulating.
Proceedings of the ISA '91 Algorithms, 1991

A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms.
ACM Trans. Graph., 1990

Tetrahedrizing Point Sets in Three Dimensions.
J. Symb. Comput., 1990

Ranking intervals under visibility constraints.
Int. J. Comput. Math., 1990

The Computational Geometry Column.
Bull. EATCS, 1990

Covering convex sets with non-overlapping polygons.
Discret. Math., 1990

The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2.
Discret. Comput. Geom., 1990

The Complexity of Many Cells in Arrangements of Planes and Related Problems.
Discret. Comput. Geom., 1990

The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments.
Discret. Comput. Geom., 1990

Combinatorial Complexity Bounds for Arrangement of Curves and Spheres.
Discret. Comput. Geom., 1990

An acyclicity theorem for cell complexes in d dimension.
Comb., 1990

Searching for Empty Convex Polygons.
Algorithmica, 1990

A Hyperplane Incidence Problem with Applications to Counting Distances.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

Lines in Space-A Collection of Results.
Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

Slimming Down by Adding: Selecting Heavily Covered Points.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Probing Convex Polytopes.
Proceedings of the Autonomous Robot Vehicles, 1990

1989
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.
Theor. Comput. Sci., 1989

Partitioning Space for Range Queries.
SIAM J. Comput., 1989

Topologically Sweeping an Arrangement.
J. Comput. Syst. Sci., 1989

The Computation Geometry Column.
Bull. EATCS, 1989

The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.
Discret. Comput. Geom., 1989

Implicitly Representing Arrangements of Lines or Segments.
Discret. Comput. Geom., 1989

On Arrangement of Jordan Arcs with Three Intersection per Pair.
Discret. Comput. Geom., 1989

The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces.
Discret. Comput. Geom., 1989

The Complexity of Cutting Complexes.
Discret. Comput. Geom., 1989

Combinatorial and Computational Results for Line Arrangements in Space.
Proceedings of the Algorithms and Data Structures, 1989

Lines in Space-Combinatorics, Algorithms and Applications
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

An Acyclicity Theorem for Cell Complexes in <i>d</i> Dimensions.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Minimum Polygonal Separation
Inf. Comput., June, 1988

Probing Convex Polygons with X-Rays.
SIAM J. Comput., 1988

Tetrahedrizing Point Sets in Three Dimensions.
Proceedings of the Symbolic and Algebraic Computation, 1988

Geometric Structures in Computational Geometry.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

The Complexity of Many Faces in Arrangements of Lines of Segments.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

On Arrangements of Jordan Arcs with Three Intersections per Pair.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
Algorithms in Combinatorial Geometry
EATCS Monographs on Theoretical Computer Science 10, Springer, ISBN: 038713722X, 1987

An Improved Algorithm for Constructing <i>k</i> th-Order Voronoi Diagrams.
IEEE Trans. Computers, 1987

Space Searching for Intersecting Objects.
J. Algorithms, 1987

A Tight Lower Bound on the Size of Visibility Graphs.
Inf. Process. Lett., 1987

Zooming by Repeated Range Detection.
Inf. Process. Lett., 1987

Linear Space Data Structures for Two Types of Range Search.
Discret. Comput. Geom., 1987

The Complexity of Cutting Convex Polytopes
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

On the Lower Envelope of Bivariate Functions and its Applications
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
Constructing Belts in Two-Dimensional Arrangements with Applications.
SIAM J. Comput., 1986

Constructing Arrangements of Lines and Hyperplanes with Applications.
SIAM J. Comput., 1986

Optimal Point Location in a Monotone Subdivision.
SIAM J. Comput., 1986

Computing a Ham-Sandwich Cut in Two Dimensions.
J. Symb. Comput., 1986

On the maximal number of edges of many faces in an arrangement.
J. Comb. Theory, Ser. A, 1986

The number of extreme pairs of finite point-sets in Euclidean spaces.
J. Comb. Theory, Ser. A, 1986

Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time.
Inf. Process. Lett., 1986

The complexity of cells in three-dimensional arrangements.
Discret. Math., 1986

Voronoi Diagrams and Arrangements.
Discret. Comput. Geom., 1986

Rectangular Point Location in d Dimensions with Applications.
Comput. J., 1986

Edge-Skeletons in Arrangements with Applications.
Algorithmica, 1986

Probing Convex Polytopes
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Linear Data Structures for Two Types of Range Search.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
Finding Transversals for Sets of Simple Geometric Figures.
Theor. Comput. Sci., 1985

Optimal Solutions for a Class of Point Retrieval Problems.
J. Symb. Comput., 1985

On the Number of Line Separations of a Finite Set in the Plane.
J. Comb. Theory, Ser. A, 1985

Batched Dynamic Solutions to Decomposable Searching Problems.
J. Algorithms, 1985

Computing the Extreme Distances Between Two Convex Polygons.
J. Algorithms, 1985

Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane.
Inf. Process. Lett., 1985

An improved algorithm for constructing kth-order Voronoi diagrams.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
An optimal algorithm for constructing the weighted voronoi diagram in the plane.
Pattern Recognit., 1984

Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.
RAIRO Theor. Informatics Appl., 1984

Some methods of computational geometry applied to computer graphics.
Comput. Vis. Graph. Image Process., 1984

Key-Problems and Key-Methods in Computational Geormetry.
Proceedings of the STACS 84, 1984

Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983
On the shape of a set of points in the plane.
IEEE Trans. Inf. Theory, 1983

Finding Extreme Distances between Convex Polygons.
Proceedings of the WG '83, 1983

On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract).
Proceedings of the Automata, 1983

1982
On the Equivalence of Some Rectangle Problems.
Inf. Process. Lett., 1982

Polygonal Intersection Searching.
Inf. Process. Lett., 1982

Stabbing Line Segments.
BIT Comput. Sci. Sect., 1982

1981
A Space-Optimal Solution of General Region Location.
Theor. Comput. Sci., 1981

On the Intersection of Orthogonal Objects.
Inf. Process. Lett., 1981


  Loading...