James A. Storer

Papers

Total Citations

H-Index

About

James A. Storer has made foundational contributions to computational geometry and data compression. His seminal 1985 paper on shortest paths in Euclidean space with polyhedral obstacles, which has garnered 33 citations, introduced efficient algorithms for computing minimum-length paths that avoid polyhedral obstacles—a problem central to robotics, geographic information systems, and motion planning. By analyzing the number of obstacle edges and islands, Storer provided rigorous complexity bounds that remain influential in algorithmic geometry. In data compression, his 1997 work on error-resilient optimal data compression (20 citations) tackled the challenge of reliable communication in the presence of errors, proposing flexible frameworks that integrate compression with error detection and correction. This research has practical implications for storage and transmission systems where data integrity is critical. Storer’s work bridges theory and application, offering elegant solutions to real-world problems. His contributions are widely cited in computational geometry and compression communities, reflecting their lasting impact on algorithm design and information theory.