Shortest paths on polyhedral surfaces and terrains
From MaRDI portal
(Redirected from Publication:5259571)
Recommendations
- scientific article; zbMATH DE number 3907791
- Shortest Path Problems on a Polyhedral Surface
- Shortest path problems on a polyhedral surface
- Approximate shortest path on a polyhedral surface and its applications
- Shortest paths on realistic polyhedra
- scientific article; zbMATH DE number 727953
- scientific article; zbMATH DE number 1225263
- On Shortest Paths Amidst Convex Polyhedra
- Efficiently determining a locally exact shortest path on polyhedral surfaces
- Approximating shortest paths on weighted polyhedral surfaces
Cites work
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 5485574 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Bounds on the sample complexity for private learning and private data release
- Characterizing the sample complexity of private learners
- Collusion-secure fingerprinting for digital data
- Differential privacy and the fat-shattering dimension of linear queries
- Efficient algorithms for privately releasing marginals via convex relaxations
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Interactive privacy via the median mechanism
- Iterative Constructions and Private Data Release
- Lower bounds in differential privacy
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- On the complexity of differentially private data release, efficient algorithms and hardness results
- On the geometry of differential privacy
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Theory of Cryptography
Cited in
(9)- Optimal facility location problem on polyhedral terrains using descending paths
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- 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
- Navigating weighted regions with scattered skinny tetrahedra
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)
