Shortest paths on polyhedral surfaces and terrains

DOI10.1145/2591796.2591821zbMATH Open1315.68253OpenAlexW2080237972MaRDI QIDQ5259571FDOQ5259571

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of Cryptography
• The geometry of differential privacy: the small database and approximate cases
• 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
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• On the complexity of differentially private data release
• Collusion-secure fingerprinting for digital data
• Advances in Cryptology – CRYPTO 2004
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Characterizing the sample complexity of private learners
• Faster Algorithms for Privately Releasing Marginals
• Faster private release of marginals on small databases
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately releasing conjunctions and the statistical query barrier
• Efficient algorithms for privately releasing marginals via convex relaxations

Cited In (9)

• Optimal facility location problem on polyhedral terrains using descending paths
• Navigating Weighted Regions with Scattered Skinny Tetrahedra
• Title not available (Why is that?)
• Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path
• Shortest descending paths through given faces
• Shortest Journeys in Directed Temporal Graphs
• Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
• Multiple shooting approach for computing approximately shortest paths on convex polytopes
• Efficiently determining a locally exact shortest path on polyhedral surfaces

Uses Software

• SuLQ

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Shortest Path Problems on a Polyhedral Surface 👍 👎
• Approximating shortest paths on weighted polyhedral surfaces 👍 👎
• Shortest path problems on a polyhedral surface 👍 👎
• Efficiently determining a locally exact shortest path on polyhedral surfaces 👍 👎
• Approximate shortest path on a polyhedral surface and its applications 👍 👎
• Shortest paths on realistic polyhedra 👍 👎
• On Shortest Paths Amidst Convex Polyhedra 👍 👎

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

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