Results 231 to 240 of about 123,753 (267)
Some of the next articles are maybe not open access.
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
Output-Sensitive Parallel Algorithm for Polygon Clipping
2014 43rd International Conference on Parallel Processing, 2014Polygon clipping is one of the complex operations in computational geometry. It is a primitive operation in many fields such as Geographic Information Systems (GIS), Computer Graphics and VLSI CAD. Sequential algorithms for this problem are in abundance in literature but there are very few parallel algorithms solving it in its most general form.
Satish Puri, Sushil K. Prasad
openaire +1 more source
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 Convex Hull Algorithm for Planar Objects
International Journal of Computational Geometry & Applications, 1998A set of planar objects is said to be of type m if the convex hull of any two objects has its size bounded by 2m. In this paper, we present an algorithm based on the marriage-before-conquest paradigm to compute the convex hull of a set of n planar convex objects of fixed type m. The algorithm is output-sensitive, i.e.
Nielsen, Franck, Yvinec, Mariette
openaire +2 more sources
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