- 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 · 2 citations
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
- A Simple Randomized Sieve Algorithm for the Closest-Pair Problem
1995/04/01 by S. Khuller, Samir Khuller, Yossi Matias +1 · 2 citations
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algorithm #Algorithms and Data Compression #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Deterministic algorithm #Dijkstra's algorithm #Freivalds' algorithm #Mathematics #Physics #Randomized algorithm #SIMPLE algorithm #Shortest path problem #Sieve (category theory) #Simple (philosophy)
- A Faster Deterministic Maximum Flow Algorithm
1994/11/01 by Valerie King, V. King, S. Rao +3 · 4 citations
Computer Science · Economics, Econometrics and Finance · Mathematics · #Advanced Graph Theory Research #Algorithm #Binary logarithm #Combinatorics #Complexity and Algorithms in Graphs #Computation #Computer science #Constant (computer programming) #Control flow graph #Deterministic algorithm #Dijkstra's algorithm #Directed graph #Discrete mathematics #Flow (mathematics) #Freivalds' algorithm #Game Theory and Voting Systems #Graph #Mathematics #Maximum flow problem #Randomized algorithm #Running time #Shortest path problem #Time complexity
- An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
1991/12/01 by Hillel Gazit · 2 citations
Computer Science · Mathematics · #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Graph Theory and Algorithms #Combinatorics #Randomized algorithm #Mathematics #Graph #Undirected graph #Binary logarithm #Algorithm #Freivalds' algorithm #Product (mathematics) #Running time #Discrete mathematics
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
1991/07/01 by Raimund Seidel · 2 citations
Computer Science · Environmental Science · Mathematics · #Algorithm #Binary logarithm #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Data Management and Algorithms #Freivalds' algorithm #Geometry #Graph #Line segment #Logarithm #Mathematics #Plane (geometry) #Polygonal chain #Randomized algorithm #Regular polygon #Remote Sensing and LiDAR Applications #Running time #SIMPLE algorithm #Set (abstract data type) #Shortest path problem #Simple (philosophy) #Simple polygon #Time complexity