Data structures for extension violations in a query range

DOI10.1007/S10852-010-9144-YMaRDI QIDQ662125zbMATH OpenOpenAlexFDO

Authors Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan

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) Applications of design theory to circuits and networks (94C30) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• scientific article; zbMATH DE number 3919827
• scientific article; zbMATH DE number 4039253
• Publication:3469043
• scientific article; zbMATH DE number 475618
• Optimal algorithms for some polygon enclosure problems for VLSI layout analysis

Cites work

• scientific article; zbMATH DE number 1241835 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Algorithms and Computation
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• Data structures for range-aggregate extent queries
• Priority Search Trees

Cited in

(2)

• Forbidden Extension Queries
• Finding pairwise intersections inside a query range

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662125)