Mark de Berg

According to our database1, Mark de Berg
  • authored at least 252 papers between 1988 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons.
JoCG, 2017

Guarding monotone art galleries with sliding cameras in linear time.
J. Discrete Algorithms, 2017

Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.
CoRR, 2017

Faster DB-scan and HDB-scan in Low-Dimensional Euclidean Spaces.
CoRR, 2017

The Homogeneous Broadcast Problem in Narrow and Wide Strips.
CoRR, 2017

Removing Depth-Order Cycles Among Triangles: An Efficient Algorithm Generating Triangular Fragments.
CoRR, 2017

Range-Clustering Queries.
CoRR, 2017

Minimum Perimeter-Sum Partitions in the Plane.
CoRR, 2017

Separability of imprecise points.
Comput. Geom., 2017

The Homogeneous Broadcast Problem in Narrow and Wide Strips.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Geodesic Spanners for Points on a Polyhedral Terrain.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Range-Clustering Queries.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Minimum Perimeter-Sum Partitions in the Plane.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

An Efficient Algorithm for the 1D Total Visibility-Index Problem.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Hierarchical Space Decompositions for Low-Density Scenes.
Encyclopedia of Algorithms, 2016

Straight-path queries in trajectory data.
J. Discrete Algorithms, 2016

Independent Set Reconfiguration Thresholds of Hereditary Graph Classes.
CoRR, 2016

Covering many points with a small-area box.
CoRR, 2016

Fine-Grained Complexity Analysis of Two Classic TSP Variants.
CoRR, 2016

Shortcuts for the Circle.
CoRR, 2016

Distance-Sensitive Planar Point Location.
CoRR, 2016

Distance-sensitive planar point location.
Comput. Geom., 2016

Fine-Grained Complexity Analysis of Two Classic TSP Variants.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Faster Algorithms for Computing Plurality Points.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons.
IEEE Trans. Automation Science and Engineering, 2015

Progressive geometric algorithms.
JoCG, 2015

Finding Pairwise Intersections Inside a Query Range.
CoRR, 2015

Geodesic Spanners for Points on a Polyhedral Terrain.
CoRR, 2015

Separating bichromatic point sets by L-shapes.
Comput. Geom., 2015

Straight-Path Queries in Trajectory Data.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Finding Pairwise Intersections Inside a Query Range.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Fast computation of categorical richness on raster data sets and related problems.
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Improved Bounds for the Union of Locally Fat Objects in the Plane.
SIAM J. Comput., 2014

Treemaps with bounded aspect ratio.
Comput. Geom., 2014

Efficient Multi-robot Motion Planning for Unlabeled Discs in Simple Polygons.
Proceedings of the Algorithmic Foundations of Robotics XI, 2014

Separability of Imprecise Points.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Progressive Geometric Algorithms.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Guarding Monotone Art Galleries with Sliding Cameras in Linear Time.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
Fat Polygonal Partitions with Applications to Visualization and Embeddings.
JoCG, 2013

Computing Push Plans for Disk-shaped Robots.
Int. J. Comput. Geometry Appl., 2013

Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons.
CoRR, 2013

Fast Fréchet queries.
Comput. Geom., 2013

Distance-Sensitive Planar Point Location.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap.
Proceedings of the Algorithms - ESA 2013, 2013

Kinetic 2-centers in the black-box model.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model.
JoCG, 2012

Optimal Binary Space Partitions for Segments in the Plane.
Int. J. Comput. Geometry Appl., 2012

Unions of Fat Convex Polytopes Have Short Skeletons.
Discrete & Computational Geometry, 2012

Approximation algorithms for free-label maximization.
Comput. Geom., 2012

Guest Editorial.
Algorithmica, 2012

Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Kinetic Spanners in ℝd.
Discrete & Computational Geometry, 2011

Geometric Spanners for Weighted Point Sets.
Algorithmica, 2011

Out-of-Order Event Processing in Kinetic Data Structures.
Algorithmica, 2011

On Rectilinear Partitions with Minimum Stabbing Number.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Piecewise-Linear Approximations of Uncertain Functions.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Treemaps with Bounded Aspect Ratio.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Fast Fréchet Queries.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Exact and approximate computations of watersheds on triangulated terrains.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Delineating imprecise regions via shortest-path graphs.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Kinetic convex hulls and delaunay triangulations in the black-box model.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010
Visibility Maps of Realistic Terrains have Linear Smoothed Complexity.
JoCG, 2010

Optimal BSPs and Rectilinear Cartograms.
Int. J. Comput. Geometry Appl., 2010

Streaming Algorithms for Line Simplification.
Discrete & Computational Geometry, 2010

Treemaps with Bounded Aspect Ratio
CoRR, 2010

Fat Polygonal Partitions with Applications to Visualization and Embeddings
CoRR, 2010

The Traveling Salesman Problem Under Squared Euclidean Distances
CoRR, 2010

Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions.
Comput. Geom., 2010

Computing the visibility map of fat objects.
Comput. Geom., 2010

Decompositions and boundary coverings of non-convex fat polyhedra.
Comput. Geom., 2010

The complexity of flow on fat terrains and its i/o-efficient computation.
Comput. Geom., 2010

A simple and efficient kinetic spanner.
Comput. Geom., 2010

Approximation Algorithms for Free-Label Maximization.
Proceedings of the Algorithm Theory, 2010

The Traveling Salesman Problem under Squared Euclidean Distances.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Computing push plans for disk-shaped robots.
Proceedings of the IEEE International Conference on Robotics and Automation, 2010

10491 Results of the break-out group: Gulls Data.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Results of the break-out group: Aggregation.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

Better bounds on the union complexity of locally fat objects.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Optimal Binary Space Partitions in the Plane.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Finding monochromatic l-shapes in bichromatic point sets.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Kinetic kd-Trees and Longest-Side kd-Trees.
SIAM J. Comput., 2009

Covering Many or Few Points with Unit Disks.
Theory Comput. Syst., 2009

Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion.
Int. J. Comput. Geometry Appl., 2009

On rectilinear duals for vertex-weighted plane graphs.
Discrete Mathematics, 2009

Region-Fault Tolerant Geometric Spanners.
Discrete & Computational Geometry, 2009

Efficient c-oriented range searching with DOP-trees.
Comput. Geom., 2009

Cache-Oblivious R-Trees.
Algorithmica, 2009

Kinetic Collision Detection for Convex Fat Objects.
Algorithmica, 2009

Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Geometric Spanners for Weighted Point Sets.
Proceedings of the Algorithms, 2009

Rectangular cartograms: the game.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Visibility maps of realistic terrains have linear smoothed complexity.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Kinetic spanners in Rd.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
The priority R-tree: A practically efficient and worst-case optimal R-tree.
ACM Trans. Algorithms, 2008

Vertical Ray Shooting and Computing Depth Orders for Fat Objects.
SIAM J. Comput., 2008

Cache-oblivious selection in sorted X.
Inf. Process. Lett., 2008

Improved Bounds on the Union Complexity of Fat Objects.
Discrete & Computational Geometry, 2008

Cache-Oblivious Selection in Sorted X+Y Matrices
CoRR, 2008

Ray shooting and intersection searching amidst fat convex polyhedra in 3-space.
Comput. Geom., 2008

Sparse geometric graphs with small dilation.
Comput. Geom., 2008

Cutting cycles of rods in space: hardness and approximation.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Spatial Support and Spatial Confidence for Spatial Association Rules.
Proceedings of the Headway in Spatial Data Handling, 2008

Decompositions and Boundary Coverings of Non-convex Fat Polyhedra.
Proceedings of the Algorithms, 2008

The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains.
Proceedings of the Algorithms, 2008

Kinetic kd-Trees and Longest-Side kd-Trees.
Proceedings of the Data Structures, 17.02. - 22.02.2008, 2008

A simple and efficient kinetic spanner.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Fault-Tolerant Conflict-Free Coloring.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Computational geometry: algorithms and applications, 3rd Edition.
Springer, ISBN: 9783540779735, 2008

2007
Sparse geometric graphs with small dilation
CoRR, 2007

An intersection-sensitive algorithm for snap rounding.
Comput. Geom., 2007

Editorial.
Comput. Geom., 2007

Kinetic sorting and kinetic convex hulls.
Comput. Geom., 2007

Computing the Visibility Map of Fat Objects.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

I/O-Efficient Flow Modeling on Fat Terrains.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Region-fault tolerant geometric spanners.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Kinetic KD-trees and longest-side KD-trees.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

Streaming algorithms for line simplification.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
Approximate range searching using binary space partitions.
Comput. Geom., 2006

Covering Many or Few Points with Unit Disks.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Vertical ray shooting and computing depth orders for fat objects.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Optimal BSPs and rectilinear cartograms.
Proceedings of the 14th ACM International Symposium on Geographic Information Systems, 2006

Kinetic Collision Detection for Convex Fat Objects.
Proceedings of the Algorithms, 2006

Out-of-Order Event Processing in Kinetic Data Structures.
Proceedings of the Algorithms, 2006

Ray shooting and intersection searching amidst fat convex polyhedra in 3-space.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
TSP with neighborhoods of varying size.
J. Algorithms, 2005

Schematization of networks.
Comput. Geom., 2005

Optimal spanners for axis-aligned rectangles.
Comput. Geom., 2005

A Polynomial-time Algorithm to Design Push Plans for Sensorless Parts Sorting.
Proceedings of the Robotics: Science and Systems I, 2005

Sparse Geometric Graphs with Small Dilation.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

On Rectilinear Duals for Vertex-Weighted Plane Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Improved Bounds on the Union Complexity of Fat Objects.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Lower bounds for kinetic sorting.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Efficient c-Oriented Range Searching with DOP-Trees.
Proceedings of the Algorithms, 2005

Vertical ray shooting for fat objects.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Cache-oblivious r-trees.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Kinetic sorting and kinetic convex hulls.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Computational Geometry.
Proceedings of the Handbook of Data Structures and Applications., 2004

On the Design and Analysis of Competent Selecto-recombinative GAs.
Evolutionary Computation, 2004

Guest Editor's Foreword.
Discrete & Computational Geometry, 2004

Box-trees for collision checking in industrial installations.
Comput. Geom., 2004

On simplifying dot maps.
Comput. Geom., 2004

Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion.
Proceedings of the Algorithm Theory, 2004

The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

Approximate Range Searching Using Binary Space Partitions.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree.
Proceedings of the Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004

2003
Spanning Trees Crossing Few Barriers.
Discrete & Computational Geometry, 2003

On R-trees with low query complexity.
Comput. Geom., 2003

Guarding scenes against invasive hypercubes.
Comput. Geom., 2003

Significant-Presence Range Queries in Categorical Data.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Kinetic Dictionaries: How to Shoot a Moving Target.
Proceedings of the Algorithms, 2003

2002
On the fatness of Minkowski sums.
Inf. Process. Lett., 2002

Guest Editor's Foreword.
Int. J. Comput. Geometry Appl., 2002

Using Genetic Algorithms for Solving Hard Problems in GIS.
GeoInformatica, 2002

Box-Trees and R-Trees with Near-Optimal Query Time.
Discrete & Computational Geometry, 2002

Models and motion planning.
Comput. Geom., 2002

Reporting intersecting pairs of convex polytopes in two and three dimensions.
Comput. Geom., 2002

Separating an object from its cast.
Computer-Aided Design, 2002

Realistic Input Models for Geometric Algorithms.
Algorithmica, 2002

TSP with Neighborhoods of Varying Size.
Proceedings of the Algorithms, 2002

Box-trees for collision checking in industrial installations.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Schematization of road networks.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

A segment-tree based kinetic BSP.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Box-trees and R-trees with near-optimal query time.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000
Lower Bounds for Kinetic Planar Subdivisions.
Discrete & Computational Geometry, 2000

Linear Size Binary Space Partitions for Uncluttered Scenes.
Algorithmica, 2000

Scalability and Efficiency of Genetic Algorithms for Geometrical Applications.
Proceedings of the Parallel Problem Solving from Nature, 2000

On R-trees with Low Stabbing Number.
Proceedings of the Algorithms, 2000

Computational geometry: algorithms and applications, 2nd Edition.
Springer, ISBN: 3540656200, 2000

1999
Motion Planning for Multiple Robots.
Discrete & Computational Geometry, 1999

Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

On The Design of Genetic Algorithms for Geographical Applications.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 1999

Spanning Trees Crossing Few Barriers.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Lower Bounds for Kinetic Planar Subdivisions.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams.
SIAM J. Comput., 1998

Computing the Maximum Overlap of Two Convex Polygons under Translations.
Theory Comput. Syst., 1998

Computing the Angularity Tolerance.
Int. J. Comput. Geometry Appl., 1998

Motion Planning in Environments with Low Obstacle Density.
Discrete & Computational Geometry, 1998

On Levels of Detail in Terrains.
Graphical Models and Image Processing, 1998

The union of moving polygonal pseudodiscs - Combinatorial bounds and applications.
Comput. Geom., 1998

Computing constrained minimum-width annuli of point sets.
Computer-Aided Design, 1998

Guarding Scenes against Invasive Hypercubes.
Proceedings of the Algorithm Engineering, 1998

Models and Motion Planning.
Proceedings of the Algorithm Theory, 1998

Motion Planning for Multiple Robots.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Recovering lines with fixed linear probes.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Computing a Single Cell in the Overlay of Two Simple Polygons.
Inf. Process. Lett., 1997

Sparse Arrangements and the Number of Views of Polyhedral Scenes.
Int. J. Comput. Geometry Appl., 1997

Simple Traversal of a Subdivision Without Extra Storage.
International Journal of Geographical Information Science, 1997

Perfect Binary Space Partitions.
Comput. Geom., 1997

New Results on Binary Space Partitions in the Plane.
Comput. Geom., 1997

Trends and Developments in Computational Geometry.
Comput. Graph. Forum, 1997

Trekking in the Alps Without Freezing or Getting Tired.
Algorithmica, 1997

Computing Constrained Minimum-Width Annuli of Point Sets.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Realistic Input Models for Geometric Algorithms.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Separating an Object from its Cast.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Computational geometry: algorithms and applications.
Springer, ISBN: 354061270X, 1997

1996
Vertical Decompositions for Triangles in 3-Space.
Discrete & Computational Geometry, 1996

Point Location in Zones of K-flats in Arrangements.
Comput. Geom., 1996

Computing Half-plane and Strip Discrepancy of Planar Point Sets.
Comput. Geom., 1996

Efficient Generation of k-Directional Assembly Sequences.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Computing the Maximum Overlap of Two Convex Polygons Under Translations.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Simple Traversal of a Subdivision Without Extra Storage.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Visualization of TINs.
Proceedings of the Algorithmic Foundations of Geographic Information Systems, 1996

Computing the Angularity Tolerance.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

The Complexity of Rivers in Triangulated Terrains.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
Reaching a Goal with Directional Uncertainty.
Theor. Comput. Sci., 1995

Two- and Three-Dimensional Point Location in Rectangular Subdivisions.
J. Algorithms, 1995

Cuttings and applications.
Int. J. Comput. Geometry Appl., 1995

Translation queries for sets of polygons.
Int. J. Comput. Geometry Appl., 1995

Piecewise Linear Paths Among Convex Obstacles.
Discrete & Computational Geometry, 1995

On Lazy Randomized Incremental Construction.
Discrete & Computational Geometry, 1995

Generalized Hidden Surface Removal.
Comput. Geom., 1995

Simple Traversal of a Subdivision Without Extra Storage.
Proceedings of the 3rd ACM International Workshop on Advances in Geographic Information Systems, 1995

Linear Size Binary Space Partitions for Fat Objects.
Proceedings of the Algorithms, 1995

On Levels of Detail in Terrains.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Computing and Verifying Depth Orders.
SIAM J. Comput., 1994

Rectilinear Decompositions with Low Stabbing Number.
Inf. Process. Lett., 1994

Efficient Ray Shooting and Hidden Surface Removal.
Algorithmica, 1994

New Results on Binary Space Partitions in the Plane (Extended Abstract).
Proceedings of the Algorithm Theory, 1994

On lazy randomized incremental construction.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Vertical Decompositions for Triangles in 3-Space.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Constructing Levels in Arrangements and Higher Order Voronoi Diagrams.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
Piecewise linear paths among convex obstacles.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Reaching a Goal with Directional Uncertainty.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Trekking in the Alps Without Freezing or Getting Tired.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

Generalized Hidden Surface Removal.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Perfect Binary Space Partitions.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Ray Shooting, Depth Orders and Hidden Surface Removal
Lecture Notes in Computer Science 703, Springer, ISBN: 3-540-57020-9, 1993

1992
A General Approach to Dominance in the Plane.
J. Algorithms, 1992

Shortest path queries in rectilinear worlds.
Int. J. Comput. Geometry Appl., 1992

Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra.
Comput. Geom., 1992

Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract).
Proceedings of the Algorithm Theory, 1992

Computing and Verifying Depth Orders.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

Efficient algorithms for ray shooting and hidden surface removal.
PhD thesis, 1992

1991
Hidden Surface Removal for C-oriented Polyhedra.
Comput. Geom., 1991

On Rectilinear Link Distance.
Comput. Geom., 1991

Finding Squares and Rectangles in Sets of Points.
BIT, 1991

Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Efficient Ray Shooting and Hidden Surface Removal.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
Maintaining Range Trees in Secondary Memory. Part I: Partitions.
Acta Inf., 1990

Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric.
Proceedings of the SWAT 90, 1990

Translating Polygons with Applications to Hidden Surface Removal.
Proceedings of the SWAT 90, 1990

Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Finding Squares and Rectangles in Sets of Points.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1988
Dominance in the Presence of Obstracles.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988


  Loading...