October 2024
Intermediate to advanced
390 pages
10h 52m
Spanish
Content preview from Algoritmos en pocas palabras, 2ª edición
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Capítulo 10. Estructuras de árbol espaciales
Este trabajo se ha traducido utilizando IA. Agradecemos tus opiniones y comentarios: translation-feedback@oreilly.com
Los algoritmos de este capítulo se ocupan principalmente de modelar estructuras bidimensionales sobre el plano cartesiano para realizar potentes consultas de búsqueda que van más allá de la simple pertenencia, como se trata en el capítulo 5. Estos algoritmos incluyen:
- Vecino más próximo
-
Dado un conjunto de puntos bidimensionales, P, determina qué punto está más cerca de un punto de consulta objetivo, x. Esto puede resolverse en O(log n) en lugar de una solución de fuerza bruta O(n).
- Consultas de rango
-
Dado un conjunto de puntos bidimensionales, P, determina qué puntos están contenidos en una región rectangular dada. Esto puede resolverse en O(n0,5 + r), donde r es el número de puntos indicados, en lugar de una solución de fuerza bruta O(n).
- Consultas de intersección
-
Dado un conjunto de rectángulos bidimensionales, R, determina qué rectángulos intersecan una región rectangular objetivo. Esto puede resolverse en O(log n) en lugar de una solución de fuerza bruta O(n).
- Detección de colisión
-
Dado un conjunto de puntos bidimensionales, P, determina las intersecciones entre cuadrados de lado s centrados en dichos puntos. Esto puede resolverse en O(n log n) en lugar de una solución de fuerza bruta O(n2).
Las estructuras y los algoritmos se extienden naturalmente a múltiples dimensiones, pero este capítulo se limitará ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.