We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
A complex software system typically has a large number of objects in the memory, holding references to each other to implement an object model. Deciding when the objects should be...
Recent years have witnessed significant advances in 3D brush modeling and simulation in digital paint tools. Compared with traditional 2D brushes, a 3D brush can be both more intu...
Nelson Siu-Hang Chu, William Baxter, Li-Yi Wei, Na...
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...