Michiel Smid

Papers

Total Citations

H-Index

About

Michiel Smid is a leading figure in computational geometry and algorithm design, with a career dedicated to solving fundamental problems in geometric intersection searching and data structures. His work addresses challenges that arise in VLSI layout design, database query-retrieval, robotics, and computer graphics, often formalized as geometric intersection problems. Smid’s key contributions include pioneering generalized (or colored) intersection searching, which extends classical problems to handle multiple categories or colors of objects, enabling more nuanced queries in complex datasets. His highly cited 2018 paper on this topic (8 citations) exemplifies his ability to bridge theory and application, offering efficient preprocessing and query algorithms that have influenced subsequent research. With a publication record spanning decades, Smid has also made notable strides in range searching, proximity problems, and randomized algorithms, earning recognition as a co-author of seminal textbooks and a mentor to emerging researchers. His work’s impact is reflected in hundreds of citations, underscoring his role in shaping modern computational geometry and inspiring students to explore the intersection of theory and real-world problem-solving.