computational geometry, a sweep line algorithm or plane sweep algorithm is an algorithmic paradigm that uses a conceptual sweep line or sweep surface to solve...

computational geometry, the Bentley–Ottmann algorithm is a sweep line algorithm for listing all crossings in a set of line segments, i.e. it finds the intersection...

Fortune's algorithm is a sweep line algorithm for generating a Voronoi diagram from a set of points in a plane using O(n log n) time and O(n) space. It...

calipers can be interpreted as the projective dual of a sweep line algorithm in which the sweep is across slopes of lines rather than across x- or y-coordinates...

Dynamic programming Greedy algorithm Recursion Prune and search Kernelization Iterative compression Sweep line algorithms Rotating calipers Randomized...

of segments is to use a sweep line algorithm, where we imagine a line sliding across the line segments and we track which line segments it intersects at...

smoothing: an algorithm to smooth a polygonal mesh Line segment intersection: finding whether lines intersect, usually with a sweep line algorithm Bentley–Ottmann...

tool Sweep account, a kind of bank account Sweep line algorithm, a concept in computational geometry Sweeps, a regional English term for windmill sails...

on polygons tend to use plane sweep algorithms (or Sweep line algorithms). A list of papers using plane sweep algorithms for Boolean operations on polygons...

smoothing: an algorithm to smooth a polygonal mesh Line segment intersection: finding whether lines intersect, usually with a sweep line algorithm Bentley–Ottmann...

partitioned into monotone subpolygons in O(n log n) time using a sweep-line approach. The algorithm does not require the polygon to be simple, thus it can be...

in computational geometry, and is known for the Shamos–Hoey sweep line algorithm for line segment intersection detection and for the rotating calipers...

algorithm for hidden-line elimination. Internat. J. Computer Mathematics, 18(2):93–119, 1985. O. Nurmi. A fast line-sweep algorithm for hidden line elimination...

other algorithms. The technique is also known as stop-and-copy. Cheney's algorithm is an improvement on the semi-space collector. A mark and sweep garbage...

problem. Both sweep line algorithms and divide-and-conquer algorithms with this slower time bound are commonly taught as examples of these algorithm design techniques...

operations are monotonic. Similarly, in sweep line algorithms in computational geometry, events at which the sweep line crosses a point of interest are prioritized...

the top; this is conceptually similar to the Bentley–Ottmann algorithm. This sweep line approach divides the problem space by scanlines, imaginary horizontal...

tracing algorithm is similar to the Square tracing algorithm with similar weaknesses but works with 8-connected (diagonal) patterns Radial sweep Theo Pavlidis’...

be constructed in O(n log n) using a divide and conquer algorithm or a sweep line algorithm. The problem commonly arises in physical design of electronic...

moving canon style one at a time. After each movement, the line takes a step forward. Algorithm March lyrics, in English and Japanese (Romaji). Note: this...

original algorithm, this was a burst of white noise, but it can also include any wideband signal, such as a rapid sine wave chirp or frequency sweep, or a...

Refinement collision detection algorithm is a technique for determining whether two convex shapes overlap. The algorithm was created by Gary Snethen in...

representation is useful because the associated dominance order allows sweep line algorithms to be used. Bitolerance graphs are incomparability graphs of a bitolerance...

Delaunay triangulation that uses a radially propagating sweep-hull, and a flipping algorithm. The sweep-hull is created sequentially by iterating a radially-sorted...

A cellular evolutionary algorithm (cEA) is a kind of evolutionary algorithm (EA) in which individuals cannot mate arbitrarily, but every one interacts...

simultaneous sweep through a row of A and a column of B) incurs a cache miss when accessing an element of B. This means that the algorithm incurs Θ(n3)...

although the algorithm divides the data into p + 1 {\displaystyle p+1} blocks, only p processing elements run in parallel at a time. In a first sweep, each PE...

monotone polygon is sweepable by a line which does not change its orientation during the sweep. A polygon is strictly sweepable if no portion of its...

divide-and-conquer algorithm to compute the visibility polygon was proposed in 1987. An angular sweep, i.e. rotational plane sweep algorithm to compute the...

{\displaystyle p} of the hull, sweep a line circularly around p {\displaystyle p} , subdividing the plane into wedges within which the sweep line crosses one of the...