Optimal output-sensitive convex hull algorithms in two and three dimensions
Reads0
Chats0
TLDR
This work presents simple output-sensitive algorithms that construct the convex hull of a set of n points in two or three dimensions in worst-case optimalO (n logh) time and O (n) space, whereh denotes the number of vertices of the conveX hull.Abstract:
We present simple output-sensitive algorithms that construct the convex hull of a set ofn points in two or three dimensions in worst-case optimalO (n logh) time andO (n) space, whereh denotes the number of vertices of the convex hull.read more
Citations
More filters
Posted Content
Computational Optimal Transport
Gabriel Peyré,Marco Cuturi +1 more
TL;DR: This short book reviews OT with a bias toward numerical methods and their applications in data sciences, and sheds lights on the theoretical properties of OT that make it particularly useful for some of these applications.
Book ChapterDOI
Arrangements and Their Applications
Pankaj K. Agarwal,Micha Sharir +1 more
TL;DR: This chapter surveys combinatorial and algorithmic properties of arrangements of arcs in the plane and of surface patches in higher dimensions and presents many applications of arrangements to problems in motion planning, visualization, range searching, molecular modeling, and geometric optimization.
Proceedings ArticleDOI
Dynamic planar convex hull
Gerth Stølting Brodal,Riko Jacob +1 more
TL;DR: In this article, the authors present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation.
Posted Content
Dynamic Planar Convex Hull
Riko Jacob,Gerth Stølting Brodal +1 more
TL;DR: The computational complexity of the dynamic convex hull problem in the planar case is determined and a lower bound on the amortized asymptotic time complexity is given that matches the performance of this data structure.
Book ChapterDOI
The Level Ancestor Problem Simplified
TL;DR: A very simple algorithm to preprocess a given rooted tree T to answer level ancestor queries and this algorithm is simple enough to be taught and implemented.
References
More filters
Computational geometry. an introduction
TL;DR: This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
Book
Computational Geometry: An Introduction
TL;DR: In this article, the authors present a coherent treatment of computational geometry in the plane, at the graduate textbook level, and point out the way to the solution of the more challenging problems in dimensions higher than two.
Book
Algorithms in Combinatorial Geometry
TL;DR: This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems with an important role in this study.
Book
Computational geometry in C
TL;DR: In this paper, the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design are described and a self-contained treatment of the basic techniques used in computational geometry is presented.
Journal ArticleDOI
An efficient algorith for determining the convex hull of a finite planar set
TL;DR: P can be chosen to I&E the centroid oC the triangle formed by X, y and z and Express each si E S in polar coordinates th origin P and 8 = 0 in the direction of zu~ arhitnry fixed half-line L from P.