DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Orthogonal convex hull
Orthogonal convex hull
A Modified Graham's Scan Algorithm for Finding the Smallest Connected
Maximum Rectilinear Convex Subsets ∗
On the O-Hull of a Planar Point
Identifying the Pareto-Optimal Solutions for Multi-Point Distance Minimization Problem in Manhattan Space
30 POLYGONS Joseph O’Rourke, Subhash Suri, and Csaba D
Balanced Partitions of 3-Colored Geometric Sets in the Plane✩,✩✩
Hyperconvexity and Metric Embedding
Geometric Separability Using Orthogonal Objects
Mapping Tree Genera Using Discrete Lidar and Geometric Tree Metrics
Arxiv:2006.01202V1 [Cs.CG] 1 Jun 2020
Covering Points with Minimum/Maximum Area Orthogonally Convex Polygons
Maintaining the Staircase While Rotating Axes and Its Applications to Deciding Optimal Orientations∗
Computing Minimum-Area Rectilinear Convex Hull and L-Shape
Qualifying Examination Problem Maximumpoints Pointsearned
Covering Points with Orthogonally Convex Polygons ∗ Burkay Genç , Cem Evrendilek, Brahim Hnich
Variations of Good Illumination∗
C 2015 by Benjamin Adam Raichel. All Rights Reserved. in PURSUIT of LINEAR COMPLEXITY in DISCRETE and COMPUTATIONAL GEOMETRY
On the Oβ-Hull of a Planar Point
Top View
Fitting a Two-Joint Orthogonal Chain to a Point Set
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
Some Problems Related to Good Illumination*
Highway Hull Revisited Greg Aloupis Universite Libre De Bruxelles