We present sublinear algorithms to such problems as Detecting of Polytope intersection, Shortest Path on 3D convex Polytopes and volume approximation
We give an algorithmic and lower bound framework that facilitates the construction of subexponential...
An Abstract Optimization Problem (AOP) is a triple (H, <, Φ) where H is a finite set, < a tota...
AbstractGiven an n-edge convex subdivision of the plane, is it possible to report its k intersection...
We present sublinear algorithms to such problems as Detecting of Polytope intersection, Shortest Pat...
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensi...
Given a planar subdivision whose coordinates are integers bounded by U ≤ 2w [U less than or equal to...
<p>We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a pol...
We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a polygo...
AbstractWe introduce a new realistic input model for straight-line geometric graphs and nonconvex po...
<p>Large scale geometric data is ubiquitous. In this dissertation, we design algorithms and data str...
96 pagesWe consider the problem of how to construct algorithms which deal efficiently with large amo...
Our thesis is that a geometric perspective yields insights into the structure of fundamental problem...
In this paper, we study several important geometric optimization problems arising in machine learnin...
AbstractMethods are given for unifying and extending previous work on detecting intersections of sui...
chen(Qcse.nd.edu Given an n-verlex simple polygon P, the problem of computing the shortest weakly vi...
We give an algorithmic and lower bound framework that facilitates the construction of subexponential...
An Abstract Optimization Problem (AOP) is a triple (H, <, Φ) where H is a finite set, < a tota...
AbstractGiven an n-edge convex subdivision of the plane, is it possible to report its k intersection...
We present sublinear algorithms to such problems as Detecting of Polytope intersection, Shortest Pat...
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensi...
Given a planar subdivision whose coordinates are integers bounded by U ≤ 2w [U less than or equal to...
<p>We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a pol...
We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a polygo...
AbstractWe introduce a new realistic input model for straight-line geometric graphs and nonconvex po...
<p>Large scale geometric data is ubiquitous. In this dissertation, we design algorithms and data str...
96 pagesWe consider the problem of how to construct algorithms which deal efficiently with large amo...
Our thesis is that a geometric perspective yields insights into the structure of fundamental problem...
In this paper, we study several important geometric optimization problems arising in machine learnin...
AbstractMethods are given for unifying and extending previous work on detecting intersections of sui...
chen(Qcse.nd.edu Given an n-verlex simple polygon P, the problem of computing the shortest weakly vi...
We give an algorithmic and lower bound framework that facilitates the construction of subexponential...
An Abstract Optimization Problem (AOP) is a triple (H, <, Φ) where H is a finite set, < a tota...
AbstractGiven an n-edge convex subdivision of the plane, is it possible to report its k intersection...
DOI
Add to ORKG