vix.ing · top · new · best · stats · spec
  1. Testing bipartiteness of geometric intersection graphs
    2003/07/31 by David Eppstein · 1 citation
    Computer Science · Mathematics · #Combinatorics #Computational Geometry and Mesh Generation #Data Management and Algorithms #Discrete mathematics #Euclidean geometry #Euclidean space #Geometry #Graph #Graph Theory and Algorithms #Intersection (aeronautics) #Intersection graph #Line graph #Line segment #Mathematics #Pathwidth #Planar graph #Plane (geometry) #Treewidth #cs.CG
  2. On-Line Zone Construction in Arrangements of Lines in the Plane
    1999/01/01 by Yuval Aharoni, Dan Halperin, Iddo Hanniel +2 · 1 citation
    Computer Science · Engineering · Environmental Science · Mathematics · #Advanced Numerical Analysis Techniques #Algorithm #Artificial intelligence #Computation #Computational Geometry and Mesh Generation #Computer graphics (images) #Computer science #Degenerate energy levels #Geometry #Line (geometry) #Line segment #Mathematical optimization #Mathematics #Physics #Planar #Plane (geometry) #Programming language #Remote Sensing and LiDAR Applications #Set (abstract data type) #Subdivision #Theoretical computer science
  3. A polynomial time solution for labeling a rectilinear map
    1998/02/01 by Chung Keung Poon, Binhai Zhu, Chin Francis · 1 citation
    Computer Science · Engineering · Mathematics · #Computational Geometry and Mesh Generation #Advanced Numerical Analysis Techniques #Optimization and Packing Problems #Disjoint sets #Rectangle #Time complexity #Mathematics #Combinatorics #Constant (computer programming) #Line segment #Packing problems #Scheme (mathematics) #Polynomial #Natural number #Polynomial-time approximation scheme #Discrete mathematics #Algorithm #Computer science #Geometry #Mathematical analysis
  4. 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 · #Computational Geometry and Mesh Generation #Data Management and Algorithms #Remote Sensing and LiDAR Applications #Logarithm #Simple (philosophy) #Combinatorics #SIMPLE algorithm #Mathematics #Randomized algorithm #Algorithm #Time complexity #Freivalds' algorithm #Polygonal chain #Running time #Binary logarithm #Set (abstract data type) #Simple polygon #Line segment #Plane (geometry) #Graph #Computer science #Regular polygon #Geometry #Shortest path problem
  5. Topologically sweeping an arrangement
    1989/02/01 by Herbert Edelsbrunner, Leonidas Guibas · 2 citations
    Computer Science · Mathematics · #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #Data Management and Algorithms #Polytope #Computational geometry #Vertex (graph theory) #Regular polygon #Euclidean geometry #Amortized analysis #Duality (order theory) #Plane (geometry) #Line segment #Planar #Line (geometry) #Visibility #Computer science #Planar graph #Mathematics #Combinatorics #Algorithm #Geometry #Data structure #Computer graphics (images) #Physics #Graph #Optics
  6. Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic
    1989/01/01 by Victor Milenkovic · 3 citations
    Computer Science · Engineering · Mathematics · #Computational Geometry and Mesh Generation #Advanced Numerical Analysis Techniques #VLSI and FPGA Design Techniques #Rendering (computer graphics) #Grid #Arbitrary-precision arithmetic #Mathematics #Arithmetic #Monotonic function #Floating point #Line segment #Algorithm #Point (geometry) #Computer science #Discrete mathematics #Geometry #Computer graphics (images) #Mathematical analysis
  7. The power of geometric duality
    1985/03/01 by Bernard Chazelle, Leo J. Guibas, D. T. Lee · 4 citations
    Computer Science · Mathematics · #Computational Geometry and Mesh Generation #Data Management and Algorithms #Constraint Satisfaction and Optimization #Mathematics #Plane (geometry) #Duality (order theory) #Range (aeronautics) #Computation #Computational geometry #Quadratic equation #Line segment #Line (geometry) #Combinatorics #Algorithm #Discrete mathematics #Geometry
  8. An O(|V|3) algorithm for finding maximum flows in networks
    1978/10/01 by Vishv Malhotra, Mohit Kumar, Sachin Maheshwari · 1 citation
    Computer Science · Engineering · Mathematics · Social Sciences · #Advanced Optical Network Technologies #Algorithm #Approximation algorithm #Collision #Combinatorics #Computer science #Geometry #Graph #Intersection (aeronautics) #Line segment #Mathematical optimization #Mathematics #Network Traffic and Congestion Control #Path (computing) #Plane (geometry) #Routing (electronic design automation) #Set (abstract data type) #Transportation Planning and Optimization
  9. A Combinatorial Lemma for Complex Numbers
    1961/09/01 by Glen Baxter · 3 citations
    Computer Science · Mathematics · #Boundary (topology) #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Convex body #Convex hull #Convex optimization #Convex set #Data Management and Algorithms #Discrete mathematics #Geometry #Hull #Lemma (botany) #Line (geometry) #Line segment #Mathematical analysis #Mathematics #Orthogonal convex hull #Plane (geometry) #Random walk #Regular polygon #Set (abstract data type) #Statistics #Topological and Geometric Data Analysis