10,516 research outputs found
Approximate Euclidean shortest paths in polygonal domains
Given a set of pairwise disjoint simple polygonal obstacles
in defined with vertices, we compute a sketch of
whose size is independent of , depending only on and the
input parameter . We utilize to compute a
-approximate geodesic shortest path between the two given points
in time. Here, is a user
parameter, and is a small positive constant (resulting from the time
for triangulating the free space of using the algorithm in
\cite{journals/ijcga/Bar-YehudaC94}). Moreover, we devise a
-approximation algorithm to answer two-point Euclidean distance
queries for the case of convex polygonal obstacles.Comment: a few updates; accepted to ISAAC 201
Energy Eigenvalues For Supersymmetric Potentials via Quantum Hamilton-Jacobi Formalism
Using quantum Hamilton-Jacobi formalism of Leacock and Padgett, we show how
to obtain the exact eigenvalues for supersymmetric (SUSY) potentials.Comment: 15 pages Latex Compile twice to get cross references correct. 2
Figures not included. Requests for figures should be sent to
[email protected]
- …