Data structures for extension violations in a query range

DOI10.1007/s10852-010-9144-yzbMath1232.68190OpenAlexW2093722695MaRDI QIDQ662125

Kannan Srinathan, Prosenjit Gupta, Ananda Swarup Das

Publication date: 21 February 2012

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-010-9144-y

zbMATH Keywords

range searchingrange-aggregate queriesVLSI design rule checking

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Applications of design theory to circuits and networks (94C30)

Related Items (1)

Finding pairwise intersections inside a query range

Cites Work

• Data structures for range-aggregate extent queries
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• Priority Search Trees
• Algorithms and Computation
• Unnamed Item
• Unnamed Item

This page was built for publication: Data structures for extension violations in a query range