Sweep line algorithm
Class of algorithms in computational geometry that uses a conceptual sweep line/surface to solve various problems in Euclidean space
In 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 various problems in Euclidean space. It is one of the critical techniques in computational geometry.
Nº Q2372426 ★
Común · Saberes
Sweep line algorithm
Class of algorithms in computational geometry that uses a conceptual sweep line/surface to solve various problems in Euclidean space
In 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 various problems in Euclidean space. It is one of the critical techniques in computational geometry.
Último precio
—
Precio mínimo
—
Mediana 7 d
—
Ventas 30 d
0
Rango 30 d
—
En circulación
0
Cotización
mediana
mín – máx
ventas
Sin ventas en el periodo
Ver tabla
| Fecha | mediana | Mín | Máx | ventas |
|---|
Historial de ventas
- Última venta
- —
- Media 30 d
- —
- Mínimo 30 d
- —
- Máximo 30 d
- —
- Ventas 7 d
- 0
- Ventas 30 d
- 0
Aún no hay ventas.
Ventas anónimas: sin comprador ni vendedor. Las cifras solo cuentan ventas entre jugadores.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
In 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 various problems in Euclidean space. It is one of the critical techniques in computational geometry. The idea behind algorithms of this type is to imagine that a line (often a vertical line) is swept or moved across the plane, stopping at some points. Geometric operations are restricted to geometric objects that either intersect or are in the immediate vicinity of the sweep line whenever it stops, and the complete solution is available once the line has passed over all objects.
Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: Kmschaal (CC BY-SA 4.0) ·
Cartas cercanas
-
Algoritmo de Bresenham
Nº Q549860 ★★
Sin ofertas
-
Geometría algebraica
Una rama de la matemática que combina el álgebra abstracta con la geometría analítica
Nº Q180969 ★★★
Sin ofertas
-
Geometría computacional
Nº Q874709 ★
Sin ofertas
-
Hiperplano
Nº Q657586 ★★
Sin ofertas
-
A
Algoritmo voraz
Nº Q504353 ★★★
Sin ofertas
-
Función convexa
Nº Q319913 ★★
Sin ofertas