Bokdetaljer
Format
Pocketbok
Språk
Engelska
Publicerad
Jan 1, 1996
Förlag
PN
Beskrivning
In the realm of computational geometry, a significant area of research is dedicated to range searching, an essential technique for efficiently querying multidimensional data. Pankaj K. Agarwal delves into the principles and methodologies that underpin this fascinating domain, exploring both theoretical foundations and practical applications.
The work presents a comprehensive examination of various data structures and algorithms utilized in range searching. Through insightful examples and detailed analyses, the author unveils the nuances of achieving optimal search performance across different dimensions. Readers are invited to grasp not only the complexities of range queries but also the advancements that have emerged within the field.
Targeted towards researchers and practitioners, this exploration emphasizes the importance of range searching in fields such as computer graphics, data mining, and geographic information systems. Agarwal's contribution serves as a vital resource for anyone looking to deepen their understanding of this core area in computational geometry.
The work presents a comprehensive examination of various data structures and algorithms utilized in range searching. Through insightful examples and detailed analyses, the author unveils the nuances of achieving optimal search performance across different dimensions. Readers are invited to grasp not only the complexities of range queries but also the advancements that have emerged within the field.
Targeted towards researchers and practitioners, this exploration emphasizes the importance of range searching in fields such as computer graphics, data mining, and geographic information systems. Agarwal's contribution serves as a vital resource for anyone looking to deepen their understanding of this core area in computational geometry.