Journal Article10.1016/J.JPDC.2006.12.006
Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel
Neelima Gupta,S. Chopra +1 more
TL;DR: This paper describes an O(logn.(logH+loglogn)) time deterministic algorithm for the problem, that achieves O(nlogH) work bound for [email protected](logn), and presents a fast randomized algorithm that runs in expected time O(logH).
read more
About: This article is published in Journal of Parallel and Distributed Computing. The article was published on 01 Jul 2007. The article focuses on the topics: Output-sensitive algorithm & Deterministic algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Planar lower envelope of monotone polygonal chains
TL;DR: An algorithm to find the lower envelope of monotone polygonal chains is proposed, simpler than known methods and requires no complex data structures, for output-sensitive construction of line segment lower envelope.
1
Planar lower envelope of monotone polygonal chains
TL;DR: In this paper, a simple linear search algorithm running in O( n + m k ) time is proposed for constructing the lower envelope of k vertices from m monotone polygonal chains in 2D with n vertices in total.
References
•Book
Computational Geometry: An Introduction
Franco P. Preparata,Michael Ian Shamos +1 more
- 01 Jan 1978
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.
4.5K
Computational Geometry
Franco P. Preparata,M. Shamos +1 more
- 01 Sep 1985
TL;DR: This book clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics and points the way to the solution of the more challenging problems in dimensions higher than two.
3.1K
Applications of random sampling in computational geometry, II
Kenneth L. Clarkson
- 06 Jan 1988
TL;DR: Asymptotically tight bounds for a combinatorial quantity of interest in discrete and computational geometry, related to halfspace partitions of point sets, are given.
•Book
Davenport-Schinzel sequences and their geometric applications
Micha Sharir,Pankaj K. Agarwal +1 more
- 01 Jan 1995
TL;DR: A close to linear bound on the maximum length of Davenport--Schinzel sequences enable us to derive sharp bounds on the combinatorial structure underlying various geometric problems, which in turn yields efficient algorithms for these problems.
1.1K
The Parallel Evaluation of General Arithmetic Expressions
TL;DR: It is shown that arithmetic expressions with n ≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log 2 + 10(n - 1) using processors which can independently perform arithmetic operations in unit time.