Marc van Kreveld
#90,378
Most Influential Person Now
Dutch computational geometer
Marc van Kreveld's AcademicInfluence.com Rankings
Marc van Kreveldmathematics Degrees
Mathematics
#5630
World Rank
#7910
Historical Rank
Geometry
#111
World Rank
#171
Historical Rank
Measure Theory
#2465
World Rank
#2961
Historical Rank
Download Badge
Computer Science Mathematics
Marc van Kreveld's Degrees
- PhD Computer Science Utrecht University
- Masters Computer Science Utrecht University
Similar Degrees You Can Earn
Why Is Marc van Kreveld Influential?
(Suggest an Edit or Addition)According to Wikipedia, Marc Johan van Kreveld is a Dutch computational geometer, known as one of the authors of the textbook Computational Geometry: Algorithms and Applications . Van Kreveld completed his Ph.D. in 1992 at Utrecht University. His dissertation, New Results on Data Structures in Computational Geometry, was supervised by Mark Overmars. He is a professor of computer science at Utrecht University.
Marc van Kreveld's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Computational geometry: algorithms and applications, 3rd Edition (2000) (573)
- Contour trees and small seed sets for isosurface traversal (1997) (381)
- Computing longest duration flocks in trajectory data (2006) (302)
- Label placement by maximum independent set in rectangles (1998) (234)
- Finding REMO - Detecting Relative Motion Patterns in Geospatial Lifelines (2004) (231)
- Spatial information retrieval and geographical ontologies an overview of the SPIRIT project (2002) (197)
- Efficient detection of motion patterns in spatio-temporal data sets (2004) (171)
- On rectangular cartograms (2004) (161)
- Computational Geometry (2000) (150)
- Point labeling with sliding labels (1999) (142)
- Efficient Detection of Patterns in 2D Trajectories of Moving Points (2007) (130)
- Segmenting trajectories: A framework and algorithms using spatiotemporal criteria (2011) (111)
- Largest and Smallest Convex Hulls for Imprecise Points (2010) (109)
- Trekking in the Alps Without Freezing or Getting Tired (1993) (102)
- Topologically correct subdivision simplification using the bandwidth criterion (1998) (98)
- Efficient ray shooting and hidden surface removal (1991) (90)
- Web-based delineation of imprecise regions (2006) (88)
- Algorithmic Foundations of Geographic Information Systems (1997) (87)
- Largest bounding box, smallest diameter, and related problems on imprecise points (2007) (86)
- Finding long and similar parts of trajectories (2009) (83)
- Digital Elevation Models and TIN Algorithms (1996) (81)
- Higher order Delaunay triangulations (2000) (80)
- Kelp Diagrams: Point Set Membership Visualization (2012) (78)
- An algorithmic framework for segmenting trajectories based on spatio-temporal criteria (2010) (73)
- A new approach to subdivision simplification (1995) (70)
- Median Trajectories (2010) (68)
- Computing the Maximum Overlap of Two Convex Polygons under Translations (1996) (65)
- Simple traversal of a subdivision without extra storage (1996) (60)
- Variations on sweep algorithms: efficient computation of extended viewsheds and class intervals (1996) (59)
- Two- and Three-Dimensional Point Location in Rectangular Subdivisions (1995) (58)
- Towards an evaluation of quality for names placement methods (2002) (58)
- On fat partitioning, fat covering and the union size of polygons (1998) (57)
- Subdivision Drawings of Hypergraphs (2009) (56)
- On Planar Supports for Hypergraphs (2009) (52)
- An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems (1993) (52)
- Schematization of networks (2005) (50)
- Improved grid map layout by point set matching (2013) (47)
- Trajectory grouping structure (2013) (47)
- The definition and computation of trajectory and subtrajectory similarity (2007) (45)
- The Complexity of Rivers in Triangulated Terrains (1996) (45)
- A simple and efficient algorithm for high-quality line labeling (2001) (44)
- Multi-Dimensional Scattered Ranking Methods for Geographic Information Retrieval* (2005) (44)
- Area-preserving approximations of polygonal paths (2006) (42)
- Schematization of road networks (2001) (42)
- Intersection Queries in Curved Objects (1993) (40)
- Preprocessing Imprecise Points and Splitting Triangulations (2008) (39)
- Generating realistic terrains with higher-order Delaunay triangulations (2005) (39)
- Range Searching (2016) (37)
- Filling Polyhedral Molds (1993) (36)
- On realistic terrains (2006) (36)
- EFFICIENT SETTLEMENT SELECTION FOR INTERACTIVE DISPLAY (1997) (35)
- Shortest path queries in rectilinear worlds (1992) (33)
- A Linear Programming Approach to Rectangular Cartograms (2006) (33)
- Efficient Algorithms for Maximum Regression Depth (1999) (33)
- Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric (1990) (33)
- AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS (1996) (33)
- Practical extensions of point labeling in the slider model (1999) (32)
- Algorithms for hotspot computation on trajectory data (2013) (32)
- Linear-Time Reconstruction of Delaunay Triangulations with Applications (1997) (32)
- Sparse Arrangements and the Number of Views of Polyhedral Scenes (1997) (32)
- High Quality Building Generalization by Extending the Morphological Operators (2008) (32)
- Algorithmic Aspects of Proportional Symbol Maps (2006) (31)
- Efficient Methods for Isoline Extraction from a TIN (1996) (31)
- Optimization for first order Delaunay triangulations (2007) (31)
- Union-copy structures and dynamic segment trees (1993) (29)
- Determining the Castability of Simple Polyhedra (1994) (28)
- Constrained higher order Delaunay triangulations (2005) (28)
- Delineating Boundaries for Imprecise Regions (2005) (28)
- Efficient methods for isoline extraction from a digital elevation model based on triangulated irregular networks (1994) (26)
- Point set labeling with sliding labels (1998) (26)
- Good orders for incremental (re)construction (1997) (26)
- On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance (2018) (24)
- Colored Spanning Graphs for Set Visualization (2013) (23)
- Time-Space Maps from Triangulations (2012) (23)
- Algorithms for the placement of diagrams on maps (2004) (22)
- Largest and Smallest Tours and Convex Hulls for Imprecise Points (2006) (22)
- Approximating largest convex hulls for imprecise points (2007) (22)
- The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs (2010) (21)
- More Geometric Data Structures (1997) (21)
- Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations (2014) (21)
- Rectilinear Decompositions with Low Stabbing Number (1994) (21)
- Distributed Ranking Methods for Geographic Information Retrieval (2004) (20)
- Packing Plane Spanning Trees and Paths in Complete Geometric Graphs (2017) (20)
- Geometric Simultaneous Embeddings of a Graph and a Matching (2009) (20)
- Labeling a Rectilinear Map More Efficiently (1999) (19)
- Planar bichromatic minimum spanning trees (2009) (19)
- Median trajectories using well-visited regions and shortest paths (2011) (19)
- Maintaining range trees in secondary memory. Part I: Partitions (1987) (19)
- Segmentation of Trajectories on Nonmonotone Criteria (2015) (19)
- Blocking Delaunay triangulations (2013) (18)
- Identifying rectangles in laser range data for urban scene reconstruction (2011) (17)
- Trajectory Grouping Structure under Geodesic Distance (2015) (17)
- Algorithms for Triangulated Terrains (1997) (17)
- Rectangular cartograms: construction & animation (2005) (17)
- Approximation Algorithms for Aligning Points (2003) (17)
- Finding squares and rectangles in sets of points (1989) (16)
- Facility Location on Terrains (1998) (16)
- Practical Extensions of Point Labeling in the Slider Model* (2002) (16)
- Segmentation of Trajectories for Non-Monotone Criteria (2013) (15)
- Shortest path queries in rectilinear worlds of higher dimension (extended abstract) (1991) (15)
- A Refined Definition for Groups of Moving Entities and its Computation (2018) (15)
- Connect the dot: Computing feed-links for network extension (2011) (14)
- Digital elevation models: overview and selected TIN algorithms (1997) (14)
- Spatial Support and Spatial Confidence for Spatial Association Rules (2008) (14)
- Central Trajectories (2015) (14)
- Edges and Switches, Tunnels and Bridges (2007) (14)
- On the shape of a set of points and lines in the plane (2011) (14)
- Bold Graph Drawings (2011) (14)
- Matched Drawings of Planar Graphs (2007) (13)
- Translating a regular grid over a point set (2003) (13)
- Contour Trees and Small Seed Sets for Isosurface Generation (2006) (13)
- Intersection queries in sets of disks (1990) (13)
- Region Intervisibility in Terrains (2007) (13)
- Folding rulers inside triangles (1996) (13)
- Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance (2016) (13)
- Good NEWS: partitioning a simple polygon by compass directions (2003) (13)
- Automated puzzle difficulty estimation (2015) (13)
- Generalizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra (2005) (12)
- Quality Ratios of Measures for Graph Drawing Styles (2014) (12)
- Trajectory Grouping Structures (2013) (12)
- Identifying Well-Covered Minimal Bounding Rectangles in 2 D Point Data (2009) (12)
- Dividedk-d trees (1991) (12)
- Grouping Time-varying Data for Interactive Exploration (2016) (12)
- Evaluating the Consistency of Cartographic Generalization (1998) (12)
- Computing Representative Networks for Braided Rivers (2017) (12)
- On Quality Paths on Polyhedral Terrains (1994) (11)
- Region-restricted clustering for geographic data mining (2006) (11)
- Optimal higher order Delaunay triangulations of polygons (2008) (11)
- From Local to Global and Back Again (1996) (11)
- Watertight Scenes from Urban LiDAR and Planar Surfaces (2013) (11)
- Processing aggregated data: the location of clusters in health data (2012) (10)
- Computational Geometry : Its objectives and relation to GIS ∗ (10)
- Geodesic Disks and Clustering in a Simple Polygon (2007) (10)
- Towards a Definition of Higher Order Constrained Delaunay Triangulations (2009) (10)
- Embedding rivers in triangulated irregular networks with linear programming (2011) (10)
- On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract) (1993) (10)
- AUTOMATED LABEL PLACEMENT FOR GROUPS OF ISLANDS (2005) (9)
- The Connect-The-Dots family of puzzles (2014) (9)
- Schematic Networks: An Algorithm and its Implementation (2002) (9)
- Line Segment Intersection (1997) (9)
- The Medial Axis of a Multi-Layered Environment and Its Application as a Navigation Mesh (2017) (8)
- Proceedings of the twenty-seventh annual symposium on Computational geometry (2011) (8)
- An Experimental Evaluation of Grouping Definitions for Moving Entities (2019) (8)
- The Painter's Problem: Covering a Grid with Colored Connected Polygons (2017) (8)
- Simplex Range Searching (1997) (8)
- Intersection queries for curved objects (extended abstract) (1991) (8)
- Facility Location on a Polyhedral Surface (2003) (8)
- Concatenable Segment Trees (Extended Abstract) (1989) (8)
- Concatenable Structures for Decomposable Problems (1994) (8)
- Connected component and simple polygon intersection searching (1996) (8)
- Rectangular cartogram computation with sea regions (2005) (8)
- Design and Automated Generation of Japanese Picture Puzzles (2019) (7)
- Orthogonal Range Searching (1997) (7)
- Minimizing local minima in terrains with higher-order Delaunay triangulations (2005) (7)
- Geo-information and computational geometry (2006) (7)
- Geographic information systems (2004) (7)
- Peeling Meshed Potatoes (2011) (6)
- Cutting a Country for Smallest Square Fit (2002) (6)
- The accelerated failure time model (2017) (6)
- Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary (2017) (6)
- Google Scholar makes it hard - the complexity of organizing one's publications (2014) (6)
- Visibility maps of segments and triangles in 3D (2006) (6)
- 10 Reasons to Get Interested in Graph Drawing (2019) (6)
- How Many Potatoes Are in a Mesh? (2012) (6)
- Scale dependent definitions of gradient and aspect and their computation (2006) (5)
- On Measures for Groups of Trajectories (2017) (5)
- Clusters in Aggregated Health Data (2008) (5)
- Between Shapes, Using the Hausdorff Distance (2020) (5)
- Finding complete bipartite subgraphs in bipartite graphs (1989) (5)
- On the Number of Empty Pseudo-Triangles in Point Sets (2007) (4)
- Optimal algorithm for computing (≤ k)-levels, with applications to separation and transversal problems (1993) (4)
- Connect the Dot: Computing Feed-Links with Minimum Dilation (2009) (4)
- Maintaining range trees in secondary memory (1990) (4)
- Trajectory Grouping Structure: the Video (2014) (4)
- The Explicit Corridor Map: Using the Medial Axis for Real-Time Path Planning and Crowd Simulation (2016) (4)
- An environmental modelling framework based on asynchronous many-tasks: Scalability and usability (2021) (4)
- Point Location in Zones of K-flats in Arrangements (1996) (4)
- Computing representative networks for braided rivers (2017) (4)
- Mobility Data Science (Dagstuhl Seminar 22021) (2022) (4)
- Geometry and topology of estuary and braided river channel networks extracted from topographic data (2018) (4)
- Topological Stability of Kinetic k-Centers (2018) (4)
- The Explicit Corridor Map: A Medial Axis-Based Navigation Mesh for Multi-Layered Environments (2017) (4)
- Arrangements and Duality (1997) (4)
- Modeling Checkpoint-Based Movement with the Earth Mover's Distance (2016) (4)
- Embedding rivers in polyhedral terrains (2009) (3)
- Feed-links for network extensions (2008) (3)
- Space-Aware Reconfiguration (2020) (3)
- Computing Correlation between Piecewise-Linear Functions (2013) (3)
- Robot Motion Planning (1997) (3)
- Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems (1996) (3)
- Geometry and Generation of a New Graph Planarity Game (2018) (3)
- ( α , δ )-Sleeves for Reconstruction of Rectilinear Building Facets (2013) (3)
- Wooden Geometric Puzzles: Design and Hardness Proofs (2007) (3)
- Printed circuit board simplification: simplifying subdivisions in practice (1995) (3)
- Graph Drawing : 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers (2012) (3)
- 10491 Results of the break-out group: Gulls Data (2010) (2)
- Computing similarity between piecewise-linear functions (2010) (2)
- Placing Text Boxes on Graphs (2009) (2)
- Finding the wood by the trees (1998) (2)
- Volume-based similarity of linear features on terrains (2018) (2)
- Graph Drawings with Relative Edge Length Specifications (2014) (2)
- Convex partial transversals of planar regions (2018) (2)
- Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning (1992) (2)
- Connected Component and Simple Polygon Intersection Searching (Extended Abstract) (1993) (2)
- Eecient Algorithms for Maximum Regression Depth (1999) (2)
- Route-preserving Road Network Generalization (2020) (2)
- Circles in the Water: Towards Island Group Labeling (2016) (1)
- Computing nice sweeps for polyhedra and polygons (2004) (1)
- AUTOMATED PRODUCTION OF SCHEMATIC NETWORKS (1)
- A Subquadratic nε-approximation for the Continuous Fréchet Distance (2023) (1)
- Schematisation of Tree Drawings (2006) (1)
- Critical Placements of a Square or Circle amidst Trajectories for Junction Detection (2016) (1)
- Empty pseudo-triangles in point sets (2011) (1)
- The Power of Parallel Projection (1993) (1)
- Reconstructing Graphs from Connected Triples (2023) (1)
- Binary Space Partitions (1997) (1)
- Scalability and composability of flow accumulation algorithms based on asynchronous many-tasks (2022) (1)
- One-to-one Point Set Matchings for Grid Map Layout ∗ (2012) (1)
- Largest Subsets of Triangles in a Triangulation (2007) (1)
- On a class of O(n²) problems in . . . (1993) (1)
- Geometric and Graph-based Approaches to Collective Motion (Dagstuhl Seminar 16022) (2016) (1)
- Proceedings of the 19th international conference on Graph Drawing (2011) (1)
- Competitive Searching for a Line on a Line Arrangement (2018) (1)
- Interaction and Collective Movement Processing (Dagstuhl Seminar 14132) (2014) (1)
- Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract) (1992) (1)
- Estimating the survival distribution (2017) (1)
- Working Group V — Visualization — Position Paper: 3D Geo-Visualization (2008) (1)
- Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance (2021) (0)
- Research resource review: GIS Algorithms (2017) (0)
- The Bayesian accelerated failure time model (2017) (0)
- Automated Construction of Rectangular Cartograms 1 (2005) (0)
- The painter’s problem (2017) (0)
- Abstract morphing using the Hausdorff distance and Voronoi diagrams (2022) (0)
- Guest Editors’ Foreword (2013) (0)
- Between Two Shapes, Using the Hausdorff Distance∗ (2020) (0)
- Spiroplots: a New Discrete-time Dynamical System to Generate Curve Patterns (2020) (0)
- Clara I. Grima, Alberto Marquez . Computational geometry on surfaces. Performing computational geometry on the cylinder, the sphere, the torus, and the cone .Dordrecht: Kluwer Academic Publishers, 2001 208 p., D 81,– ISBN 1-4020-0202-5 (2003) (0)
- Topology-aware Terrain Simplification (0)
- Detecting City Furniture and Vegetation from Mobile Mapping Point Clouds (2012) (0)
- Comparison of two or more survival distributions (2017) (0)
- The Complexity of Geodesic Spanners (2023) (0)
- Finding a minimum stretch of a function (2009) (0)
- On the Education of GIS Algorithm Design (2003) (0)
- The 1st ACM SIGSPATIAL International Workshop on Computing with Multifaceted Movement Data (MOVE++ 2019) (2020) (0)
- On Nonogram and Graph Planarity Puzzle Generation (2018) (0)
- Bivariate survival times (2017) (0)
- Connected Component and Simple Polygon Intersection Searching Connected Component and Simple Polygon Intersection Searching (1993) (0)
- A Subquadratic $n^\epsilon$-approximation for the Continuous Fr\'echet Distance (2022) (0)
- Approximate unions of lines and minkowski sums (2004) (0)
- Proceedings of the Second International Conference on Geographic Information Science (2002) (0)
- Geographic Information Science (2011) (0)
- The Connect-The-Dots Family of Puzzles: The Video (2014) (0)
- Post-masters Programme Software Technology X 00tic Automated Construction of Rectangular Cartograms 1 Object-based Updating of Land-use Maps of Ur- Ban Areas Using Satellite Remote Sensing Analytical Software Design Case Maglev Stage Software Project for Philips Applied Technolo- Gies Advertorials (2005) (0)
- Algorithms and Computation (2001) (0)
- CHAPTER ELEVENA Simple and EÆ ient Algorithmfor High-Quality Line (2011) (0)
- Collision Detection for Modular Robots - it is easy to cause collisions and hard to avoid them (2023) (0)
- Approximating the Earth Mover's Distance between sets of geometric objects (2021) (0)
- Computational Geometry Third Edition (2020) (0)
- Gourds: a sliding-block puzzle with turning (2020) (0)
- 59 GEOGRAPHIC INFORMATION SYSTEMS (2017) (0)
- Composable Art: Objects That Can Be Arranged in Many Ways (2003) (0)
- Diverse Partitions of Colored Points (2021) (0)
- On Fully Diverse Sets of Geometric Objects and Graphs (2022) (0)
- 10491 Results of the break-out group: Aggregation (2010) (0)
- DistributedRankingMethods forGeographic InformationRetrieval (2017) (0)
- Approximating the Earth Mover ’ s Distance between sets of points and line segments ∗ (2019) (0)
- Graph visualization (Invited talk) (2012) (0)
- Bayesian estimation of the survival distribution for interval-censored observations (2017) (0)
- Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, Canada (2018) (0)
- Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, Canada (2018) (0)
- Diverse Voronoi Partitions of 1D Colored Points∗ (2020) (0)
- The Spiroplot App (Media Exposition) (2020) (0)
- HKUST Institutional Repository (2003) (0)
- Creative and Coordinated Computation (2014) (0)
- Book reviews (2000) (0)
- Facility Location on Terrains (Extended Abstract) (1998) (0)
- Clear Unit-Distance Graphs ⇤ (2013) (0)
- Volume from Outlines on Terrains (2021) (0)
- Omitted topics and outlook (2017) (0)
- Interaction and Collective Movement Processing (2014) (0)
- Automatic and objective extraction of channel networks from topography in systems (2019) (0)
- Automated Construction of Rectangular Cartograms (2005) (0)
- The Bayesian proportional hazards model (2017) (0)
- Automated Visualization of Traffic and Transportation (2000) (0)
- Matching Terrains under a Linear Transformation (2009) (0)
- Inference for right-censored data (2017) (0)
- Guest Editor’s Foreword (2001) (0)
- Placing Text Boxes on Graphs A Fast Approximation Algorithm for Maximizing Overlap of a Square and a Simple Polygon (2009) (0)
- The proportional hazards model (2017) (0)
- Optimal straight-line labels for island groups (2015) (0)
This paper list is powered by the following services:
Other Resources About Marc van Kreveld
What Schools Are Affiliated With Marc van Kreveld?
Marc van Kreveld is affiliated with the following schools:
