Results 11  20
of
3,464
Parallel transitive closure and point location in planar structures
 SIAM J. COMPUT
, 1991
"... Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar stgraphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most of th ..."
Abstract

Cited by 22 (10 self)
 Add to MetaCart
Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar stgraphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most
Visualizing Data using tSNE
, 2008
"... We present a new technique called “tSNE” that visualizes highdimensional data by giving each datapoint a location in a two or threedimensional map. The technique is a variation of Stochastic Neighbor Embedding (Hinton and Roweis, 2002) that is much easier to optimize, and produces significantly b ..."
Abstract

Cited by 280 (13 self)
 Add to MetaCart
We present a new technique called “tSNE” that visualizes highdimensional data by giving each datapoint a location in a two or threedimensional map. The technique is a variation of Stochastic Neighbor Embedding (Hinton and Roweis, 2002) that is much easier to optimize, and produces significantly
Dynamization of the Trapezoid Method for Planar Point Location
, 1991
"... We present a fully dynamic data structure for point location in a monotone subdivision, based on the trapezoid method. The operations supported are insertion and deletion of vertices and edges, and horizontal translation of vertices. Let n be the current number of vertices of the subdivision. Point ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
location queries take O(log n) time, while updates take O(log2 n) time. The space requirement is O(n log n). This is the first fully dynamic point location data structure for monotone subdivisions that achieves optimal query time.
Online Point Location in Planar Arrangements and Its Applications
 GEOM
, 2002
"... Recently, HarPeled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several applications of this technique, which yield improved solutions to a variety of problems. These applications include: ( ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
: (i) an efficient mechanism for performing online point location queries in an arrangement of arcs; (ii) an efficient algorithm for computing an approximation to the minimumweight Steinertree of a set of points, where the weight is the number of intersections between the tree edges and a given
Route Optimization
 in Mobile IP", Work in Progress
, 2001
"... Community networks a b s t r a c t Wireless technologies are rapidly evolving and the users are demanding the possibility of changing their point of attachment to the Internet (i.e. Access Routers) without breaking the IP communications. This can be achieved by using Mobile IP or NEMO. However, mobi ..."
Abstract

Cited by 198 (8 self)
 Add to MetaCart
Community networks a b s t r a c t Wireless technologies are rapidly evolving and the users are demanding the possibility of changing their point of attachment to the Internet (i.e. Access Routers) without breaking the IP communications. This can be achieved by using Mobile IP or NEMO. However
Autocalibration from planar scenes
 European Conference on Computer Vision
, 1998
"... This paper describes a theory and a practical algorithm for the autocalibration of a moving projective camera, from views of a planar scene. The unknown camera calibration, and (up to scale) the unknown scene geometry and camera motion are recovered from the hypothesis that the camera’s internal par ..."
Abstract

Cited by 149 (2 self)
 Add to MetaCart
. Abstractly, since the two circular points of the 3D plane (representing its Euclidean structure) lie on the 3D absolute conic, their projections into each image must lie on the absolute conic’s image (representing the camera calibration). The resulting numerical algorithm optimizes this constraint over all
ENTROPY, TRIANGULATION, AND POINT LOCATION IN PLANAR SUBDIVISIONS
, 2009
"... A data structure is presented for point location in connected planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time that is within a constant factor of optimal. More specifically, an algorithm is presented that preprocesses a connecte ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
A data structure is presented for point location in connected planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time that is within a constant factor of optimal. More specifically, an algorithm is presented that preprocesses a
Texture mapping progressive meshes
, 2001
"... Given an arbitrary mesh, we present a method to construct a progressive mesh (PM) such that all meshes in the PM sequence share a common texture parametrization. Our method considers two important goals simultaneously. It minimizes texture stretch (small texture distances mapped onto large surface d ..."
Abstract

Cited by 251 (7 self)
 Add to MetaCart
distances) to balance sampling rates over all locations and directions on the surface. It also minimizes texture deviation (“slippage ” error based on parametric correspondence) to obtain accurate textured mesh approximations. The method begins by partitioning the mesh into charts using planarity
A Static Optimality Transformation with Applications to Planar Point Location
, 2012
"... Over the last decade, there have been several data structures that, given a planar subdivision and a probability distribution over the plane, provide a way for answering point location queries that is finetuned for the distribution. All these methods suffer from the requirement that the query distr ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
distribution must be known in advance. We present a new data structure for point location queries in planar triangulations. Our structure is asymptotically as fast as the optimal structures, but it requires no prior information about the queries. This is a 2d analogue of the jump from Knuth’s optimum binary
Optimal randomized incremental construction for guaranteed logarithmic planar point location
, 2014
"... Given a planar map of n segments in which we wish to efficiently locate points, we present the first randomized incremental construction of the wellknown trapezoidalmap searchstructure that only requires expected O(n logn) preprocessing time while deterministically guaranteeing worstcase linea ..."
Abstract
 Add to MetaCart
Given a planar map of n segments in which we wish to efficiently locate points, we present the first randomized incremental construction of the wellknown trapezoidalmap searchstructure that only requires expected O(n logn) preprocessing time while deterministically guaranteeing worst
Results 11  20
of
3,464