Marc J. van Kreveld

According to our database1, Marc J. van Kreveld
  • authored at least 216 papers between 1989 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Packing plane spanning trees and paths in complete geometric graphs.
Inf. Process. Lett., 2017

The Explicit Corridor Map: A Medial Axis-Based Navigation Mesh for Multi-Layered Environments.
CoRR, 2017

On Measures for Groups of Trajectories.
Proceedings of the Societal Geo-innovation, 2017

2016
Range Searching.
Encyclopedia of Algorithms, 2016

Segmentation of Trajectories on Nonmonotone Criteria.
ACM Trans. Algorithms, 2016

Geometric and Graph-based Approaches to Collective Motion (Dagstuhl Seminar 16022).
Dagstuhl Reports, 2016

Colored Spanning Graphs for Set Visualization.
CoRR, 2016

Grouping Time-varying Data for Interactive Exploration.
CoRR, 2016

Critical Placements of a Square or Circle amidst Trajectories for Junction Detection.
CoRR, 2016

Mapping polygons to the grid with small Hausdorff and Fréchet distance.
CoRR, 2016

A Refined Definition for Groups of Moving Entities and its Computation.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Circles in the Water: Towards Island Group Labeling.
Proceedings of the Geographic Information Science - 9th International Conference, 2016

Modeling Checkpoint-Based Movement with the Earth Mover's Distance.
Proceedings of the Geographic Information Science - 9th International Conference, 2016

Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

The Explicit Corridor Map: Using the Medial Axis for Real-Time Path Planning and Crowd Simulation.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Grouping Time-Varying Data for Interactive Exploration.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Trajectory grouping structure.
JoCG, 2015

Google Scholar makes it hard - the complexity of organizing one's publications.
Inf. Process. Lett., 2015

Improved Grid Map Layout by Point Set Matching.
Int. J. Comput. Geometry Appl., 2015

Central Trajectories.
CoRR, 2015

Trajectory Grouping Structure under Geodesic Distance.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

Automated puzzle difficulty estimation.
Proceedings of the 2015 IEEE Conference on Computational Intelligence and Games, 2015

2014
The Connect-The-Dots family of puzzles: design and automatic generation.
ACM Trans. Graph., 2014

Interaction and Collective Movement Processing (Dagstuhl Seminar 14132).
Dagstuhl Reports, 2014

Google Scholar makes it Hard - the complexity of organizing one's publications.
CoRR, 2014

Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations.
Proceedings of the Geographic Information Science - 8th International Conference, 2014

The Connect-The-Dots Family of Puzzles: The Video.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Trajectory Grouping Structure: the Video.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Quality Ratios of Measures for Graph Drawing Styles.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Graph Drawings with Relative Edge Length Specifications.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Computational Geometry.
Proceedings of the Computing Handbook, 2014

2013
Computing Correlation between Piecewise-Linear Functions.
SIAM J. Comput., 2013

Guest Editors' Foreword.
Discrete & Computational Geometry, 2013

Trajectory Grouping Structures
CoRR, 2013

Guest Editors' foreword.
Comput. Geom., 2013

Blocking Delaunay triangulations.
Comput. Geom., 2013

Watertight Scenes from Urban LiDAR and Planar Surfaces.
Comput. Graph. Forum, 2013

Median Trajectories.
Algorithmica, 2013

Trajectory Grouping Structure.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Segmentation of Trajectories for Non-Monotone Criteria.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Algorithms for hotspot computation on trajectory data.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

Colored Spanning Graphs for Set Visualization.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Improved grid map layout by point set matching.
Proceedings of the IEEE Pacific Visualization Symposium, 2013

2012
Guest Editor's Foreword.
J. Graph Algorithms Appl., 2012

Guest Editors' Foreword.
Int. J. Comput. Geometry Appl., 2012

Processing aggregated data: the location of clusters in health data.
GeoInformatica, 2012

How Many Potatoes are in a Mesh?
CoRR, 2012

Kelp Diagrams: Point Set Membership Visualization.
Comput. Graph. Forum, 2012

How Many Potatoes Are in a Mesh?
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Time-Space Maps from Triangulations.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
Segmenting trajectories: A framework and algorithms using spatiotemporal criteria.
J. Spatial Information Science, 2011

Connect the dot: Computing feed-links for network extension.
J. Spatial Information Science, 2011

Geometric Simultaneous Embeddings of a Graph and a Matching.
J. Graph Algorithms Appl., 2011

On Planar Supports for Hypergraphs.
J. Graph Algorithms Appl., 2011

Geodesic Disks and Clustering in a Simple Polygon.
Int. J. Comput. Geometry Appl., 2011

Embedding rivers in triangulated irregular networks with linear programming.
International Journal of Geographical Information Science, 2011

Empty pseudo-triangles in point sets.
Discrete Applied Mathematics, 2011

Bold graph drawings.
Comput. Geom., 2011

Finding long and similar parts of trajectories.
Comput. Geom., 2011

On the shape of a set of points and lines in the plane.
Comput. Graph. Forum, 2011

Identifying rectangles in laser range data for urban scene reconstruction.
Computers & Graphics, 2011

Peeling Meshed Potatoes.
Algorithmica, 2011

Median trajectories using well-visited regions and shortest paths.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

2010
Preprocessing Imprecise Points and Splitting Triangulations.
SIAM J. Comput., 2010

Largest bounding box, smallest diameter, and related problems on imprecise points.
Comput. Geom., 2010

Optimization for first order Delaunay triangulations.
Comput. Geom., 2010

Largest and Smallest Convex Hulls for Imprecise Points.
Algorithmica, 2010

Algorithmic Aspects of Proportional Symbol Maps.
Algorithmica, 2010

An algorithmic framework for segmenting trajectories based on spatio-temporal criteria.
Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Median Trajectories.
Proceedings of the Algorithms, 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

Computing similarity between piecewise-linear functions.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Blocking delaunay triangulations.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Wooden Geometric Puzzles: Design and Hardness Proofs.
Theory Comput. Syst., 2009

Matched Drawings of Planar Graphs.
J. Graph Algorithms Appl., 2009

Planar bichromatic minimum spanning trees.
J. Discrete Algorithms, 2009

Optimal higher order Delaunay triangulations of polygons.
Comput. Geom., 2009

Towards a definition of higher order constrained Delaunay triangulations.
Comput. Geom., 2009

Region-restricted clustering for geographic data mining.
Comput. Geom., 2009

Edges and switches, tunnels and bridges.
Comput. Geom., 2009

Connect the Dot: Computing Feed-Links with Minimum Dilation.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Finding long and similar parts of trajectories.
Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009

Geometric Simultaneous Embeddings of a Graph and a Matching.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

On Planar Supports for Hypergraphs.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Embedding rivers in polyhedral terrains.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Bold Graph Drawings.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Approximating largest convex hulls for imprecise points.
J. Discrete Algorithms, 2008

Efficient Algorithms for Maximum Regression Depth.
Discrete & Computational Geometry, 2008

On realistic terrains.
Comput. Geom., 2008

Visibility maps of segments and triangles in 3D.
Comput. Geom., 2008

Delineating Boundaries for Imprecise Regions.
Algorithmica, 2008

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

Clusters in Aggregated Health Data.
Proceedings of the Headway in Spatial Data Handling, 2008

Optimal Higher Order Delaunay Triangulations of Polygons.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Preprocessing Imprecise Points and Splitting Triangulations.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Feed-links for network extensions.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Subdivision Drawings of Hypergraphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Placing Text Boxes on Graphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

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

2007
Region Intervisibility in Terrains.
Int. J. Comput. Geometry Appl., 2007

Efficient Detection of Patterns in 2D Trajectories of Moving Points.
GeoInformatica, 2007

Edges and Switches, Tunnels and Bridges
CoRR, 2007

On rectangular cartograms.
Comput. Geom., 2007

Generating realistic terrains with higher-order Delaunay triangulations.
Comput. Geom., 2007

Approximating Largest Convex Hulls for Imprecise Points.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Optimization for First Order Delaunay Triangulations.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Edges and Switches, Tunnels and Bridges.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Geodesic Disks and Clustering in a Simple Polygon.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

The definition and computation of trajectory and subtrajectory similarity.
Proceedings of the 15th ACM International Symposium on Geographic Information Systems, 2007

Matched Drawings of Planar Graphs.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Wooden Geometric Puzzles: Design and Hardness Proofs.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Towards a Definition of Higher Order Constrained Delaunay Triangulations.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

On the Number of Empty Pseudo-Triangles in Point Sets.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Largest Subsets of Triangles in a Triangulation.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Web-based delineation of imprecise regions.
Computers, Environment and Urban Systems, 2006

Area-preserving approximations of polygonal paths.
J. Discrete Algorithms, 2006

Approximate Unions of Lines and Minkowski Sums.
Algorithmica, 2006

Largest and Smallest Tours and Convex Hulls for Imprecise Points.
Proceedings of the Algorithm Theory, 2006

Visibility Maps of Segments and Triangles in 3D.
Proceedings of the Computational Science and Its Applications, 2006

Computing longest duration flocks in trajectory data.
Proceedings of the 14th ACM International Symposium on Geographic Information Systems, 2006

Schematisation of Tree Drawings.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

Region-Restricted Clustering for Geographic Data Mining.
Proceedings of the Algorithms, 2006

Algorithmic Aspects of Proportional Symbol Maps.
Proceedings of the Algorithms, 2006

On realistic terrains.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Generalizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra.
Int. J. Comput. Geometry Appl., 2005

Multi-Dimensional Scattered Ranking Methods for Geographic Information Retrieval.
GeoInformatica, 2005

Constrained higher order Delaunay triangulations.
Comput. Geom., 2005

Schematization of networks.
Comput. Geom., 2005

Delineating boundaries for imprecise regions.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Minimizing local minima in terrains with higher-order Delaunay triangulations.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Delineating Boundaries for Imprecise Regions.
Proceedings of the Algorithms, 2005

Generating Realistic Terrains with Higher-Order Delaunay Triangulations.
Proceedings of the Algorithms, 2005

Rectangular cartograms: construction & animation.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
Geographic information systems.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Good news: Partitioning a simple polygon by compass directions.
Int. J. Comput. Geometry Appl., 2004

Algorithms for the placement of diagrams on maps.
Proceedings of the 12th ACM International Workshop on Geographic Information Systems, 2004

Efficient detection of motion patterns in spatio-temporal data sets.
Proceedings of the 12th ACM International Workshop on Geographic Information Systems, 2004

On Rectangular Cartograms.
Proceedings of the Algorithms, 2004

Approximate Unions of Lines and Minkowski Sums.
Proceedings of the Algorithms, 2004

Computing nice sweeps for polyhedra and polygons.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Facility Location on a Polyhedral Surface.
Discrete & Computational Geometry, 2003

Translating a regular grid over a point set.
Comput. Geom., 2003

Approximation Algorithms for Aligning Points.
Algorithmica, 2003

Good NEWS: partitioning a simple polygon by compass directions.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Approximation algorithms for aligning points.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Towards an evaluation of quality for names placement methods.
International Journal of Geographical Information Science, 2002

Practical Extensions of Point Labeling in the Slider Model.
GeoInformatica, 2002

Higher order Delaunay triangulations.
Comput. Geom., 2002

Spatial information retrieval and geographical ontologies an overview of the SPIRIT project.
Proceedings of the SIGIR 2002: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2002

Cutting a Country for Smallest Square Fit.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
Guest Editor's Foreword.
Algorithmica, 2001

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

2000
Higher Order Delaunay Triangulations.
Proceedings of the Algorithms, 2000

1999
Labeling a Rectilinear Map More Efficiently.
Inf. Process. Lett., 1999

Point labeling with sliding labels.
Comput. Geom., 1999

Practical Extensions of Point Labeling in the Slider Model.
Proceedings of the ACM-GIS '99, 1999

Efficient Algorithms for Maximum Regression Depth.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

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

On fat partitioning, fat covering and the union size of polygons.
Comput. Geom., 1998

Label placement by maximum independent set in rectangles.
Comput. Geom., 1998

Filling polyhedral molds.
Computer-Aided Design, 1998

Facility Location on Terrains.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Point Set Labeling with Sliding Labels.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

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

Determining the Castability of Simple Polyhedra.
Algorithmica, 1997

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

Algorithms for Triangulated Terrains.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Linear-Time Reconstruction of Delaunay Triangulations with Applications.
Proceedings of the Algorithms, 1997

Good Orders for Incremental (Re)construction.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Contour Trees and Small Seed Sets for Isosurface Traversal.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Label placement by maximum independent set in rectangles.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996
An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems.
Int. J. Comput. Geometry Appl., 1996

Efficient Methods for Isoline Extraction from a TIN.
International Journal of Geographical Information Science, 1996

Folding Rulers Inside Triangles.
Discrete & Computational Geometry, 1996

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

Connected Component and Simple Polygon Intersection Searching.
Algorithmica, 1996

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

Digital Elevation Models and TIN Algorithms.
Proceedings of the Algorithmic Foundations of Geographic Information Systems, 1996

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

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

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

Printed Circuit Board Simplification: Simplifying Subdivisions in Practice.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Concatenable Structures for Decomposable Problems
Inf. Comput., April, 1994

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

Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning.
Int. J. Comput. Geometry Appl., 1994

Efficient Ray Shooting and Hidden Surface Removal.
Algorithmica, 1994

On Quality Paths on Polyhedral Terrains.
Proceedings of the IGIS '94: Geographic Information Systems, International Workshop on Advanced Information Systems, Monte Verita, Ascona, Switzerland, February 28, 1994

Determining the Castability of Simple Polyhedra.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
Intersection Queries in Curved Objects.
J. Algorithms, 1993

Union-Copy Structures and Dynamic Segment Trees.
J. ACM, 1993

The Power of Parallel Projection.
Inf. Process. Lett., 1993

On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract).
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Filling Polyhedral Molds.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Connected Component and Simple Polygon Intersection Searching (Extended Abstract).
Proceedings of the Algorithms and Data Structures, Third Workshop, 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

An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Folding Rulers inside Triangles.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

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

Intersection Queries in Sets of Disks.
BIT, 1992

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

Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

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

Divided k-d Trees.
Algorithmica, 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

Intersection Queries for Curved Objects (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

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

Intersection Queries in Sets of Disks.
Proceedings of the SWAT 90, 1990

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

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

Concatenable Segment Trees (Extended Abstract).
Proceedings of the STACS 89, 1989


  Loading...