Results 281 to 290 of about 921,934 (330)
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
Journal of Parallel and Distributed Computing, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neelima Gupta, Sandeep Sen
semanticscholar +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Output-Sensitive Algorithms for Uniform Partitions of Points
International Symposium on Algorithms and Computation, 1999We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size buckets so that the maximum number of points in a bucket is minimized. Suppose at most (n/b) + Δ points lies in each bucket in an optimal solution.
Pankaj K. Agarwal +2 more
openaire +2 more sources
Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms
JCDCG, 2000In this paper, we review and analyze the complexity of a paradigm called grouping-and-querying which has been used in the past for computing convex hulls of points or objects on the plane, maximal and convex layer decompositions, lower envelopes of functions, etc.
F. Nielsen
openaire +2 more sources
On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2023We present a dynamic index structure for join sampling. Built for an (equi-) join Q --- let IN be the total number of tuples in the input relations of Q --- the structure uses ~O(IN) space, supports a tuple update of any relation in ~O(1) time, and ...
Shiyuan Deng, Shangqi Lu, Yufei Tao
semanticscholar +1 more source
Output-Sensitive Algorithm for Computing β-Skeletons
Computing, 2000A \(\beta\)-skeleton of a planar set of \(n\) points, i.e. the geometric graph obtained by joining the pair of points whose \(\beta\)-neighborhood is empty, can be computed by a standard algorithm in time \(O(n^{5/2}\log n)\). An algorithm is proposed to detect the \(\beta\)-skeleton in time \(O(n\log n+k)\), where \(k\) is the size of the output graph.
Mukhopadhyay, A., Rao, S. V.
openaire +1 more source
An Output-Sensitive Algorithm for Computing Visibility Graphs
SIAM Journal on Computing, 1987Summary: The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertex set consists of the vertices of the obstacles and whose edges are pairs of vertices \((u,v)\) such that the open line segment between \(u\) and \(v\) does not intersect any of the obstacles. The visibility graph is an important
Ghosh, Subir Kumar, Mount, David M.
openaire +2 more sources
Faster output-sensitive skyline computation algorithm
Information Processing Letters, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Jinfei, Xiong, Li, Xu, Xiaofeng
openaire +2 more sources
More output-sensitive geometric algorithms
Proceedings 35th Annual Symposium on Foundations of Computer Science, 2002A simple idea for speeding up the computation of extrema of a partially ordered set turns out to have a number of interesting applications in geometric algorithms; the resulting algorithms generally replace an appearance of the input size n in the running time by an output size A/spl les/n.
openaire +1 more source
An Output-Sensitive Flexible Pattern Discovery Algorithm
2001Given an input sequence of data, a motif is a repeating pattern, possibly interspersed with "dont care" characters and a flexible motif could have a variable (as opposed to fixed) number of "dont care" characters. Given a sequence of records with F fields each, an association rule is a common set of f fields, f ?
Laxmi Parida +2 more
openaire +1 more source
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
Algorithmica, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source