M. T. Goodrich
- A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
2001/01/01 by Nancy M. Amato, N. M. Amato, Michael T. Goodrich +3 · 1 citation
Computer Science · Engineering · Mathematics · #3D Shape Modeling and Analysis #Algorithm #Artificial intelligence #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Dijkstra's algorithm #Freivalds' algorithm #Mathematics #Polygon (computer graphics) #Polygon covering #Preprocessor #Randomized algorithm #Regular polygon #Robotics and Sensor-Based Localization #SIMPLE algorithm #Shortest path problem #Simple (philosophy) #Simple polygon #Time complexity
- Almost optimal set covers in finite VC-dimension
1995/12/01 by H. Brönnimann, Hervé Brönnimann, Michael T. Goodrich +1 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Algorithm #Approximation algorithm #Binary logarithm #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computational complexity theory #Computational geometry #Computer science #Constant (computer programming) #Cover (algebra) #Dimension (graph theory) #Discrete mathematics #Finite set #Geometry #Greedy algorithm #Mathematical analysis #Mathematics #Polytope #Set (abstract data type) #Set cover problem #Time complexity #Upper and lower bounds #VC dimension