Shortest paths on polyhedral surfaces and terrains

DOI10.1145/2591796.2591821zbMath1315.68253OpenAlexW2080237972MaRDI QIDQ5259571

Jiongxin Jin, Siu-Wing Cheng

Publication date: 26 June 2015

Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://repository.ust.hk/ir/bitstream/1783.1-64512/1/paper.pdf

zbMATH Keywords

shortest pathpolyhedral surfaceterrainconvex distance function

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Unnamed Item ⋮ Navigating Weighted Regions with Scattered Skinny Tetrahedra ⋮ Shortest Journeys in Directed Temporal Graphs ⋮ Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves ⋮ Optimal facility location problem on polyhedral terrains using descending paths ⋮ Multiple shooting approach for computing approximately shortest paths on convex polytopes

Uses Software

• SuLQ

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for privately releasing marginals via convex relaxations
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Faster Algorithms for Privately Releasing Marginals
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately Releasing Conjunctions and the Statistical Query Barrier
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower Bounds in Differential Privacy
• Iterative Constructions and Private Data Release
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Collusion-secure fingerprinting for digital data
• On the complexity of differentially private data release
• Advances in Cryptology – CRYPTO 2004
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography

This page was built for publication: Shortest paths on polyhedral surfaces and terrains