Results 1  10
of
27
GeoCast  Geographic Addressing and Routing
, 1997
"... In the near future GPS will be widely used, thus allowing a broad variety of location dependent services such as direction giving, navigation, etc. In this paper we propose and evaluate a routing and addressing method to integrate geographic coordinates into the Internet Protocol to enable the creat ..."
Abstract

Cited by 172 (4 self)
 Add to MetaCart
In the near future GPS will be widely used, thus allowing a broad variety of location dependent services such as direction giving, navigation, etc. In this paper we propose and evaluate a routing and addressing method to integrate geographic coordinates into the Internet Protocol to enable the creation of location dependent services. The main challenge is to integrate the concept of physical location into the current design of the Internet which relies on logical addressing.
Efficient Collision Detection for Animation and Robotics
, 1993
"... We present efficient algorithms for collision detection and contact determination between geometric models, described by linear or curved boundaries, undergoing rigid motion. The heart of our collision detection algorithm is a simple and fast incremental method to compute the distance between two ..."
Abstract

Cited by 108 (19 self)
 Add to MetaCart
We present efficient algorithms for collision detection and contact determination between geometric models, described by linear or curved boundaries, undergoing rigid motion. The heart of our collision detection algorithm is a simple and fast incremental method to compute the distance between two convex polyhedra. It utilizes convexity to establish some local applicability criteria for verifying the closest features. A preprocessing procedure is used to subdivide each feature's neighboring features to a constant size and thus guarantee expected constant running time for each test. The expected constant time performance is an attribute from exploiting the geometric coherence and locality. Let n be the total number of features, the expected run time is between O( p n) and O(n) ...
Gpsbased geographic addressing, routing, and resource discovery
 Communication of the ACM
, 1999
"... The Global Positioning System can be used to give every terminal a geographic address for multicasting to and from recipients within specified geographical areas. 86 April 1999/Vol. 42, No. 4 COMMUNICATIONS OF THE ACMGPS cards will soon be included in cars manufactured in the U.S. and Europe and pos ..."
Abstract

Cited by 74 (0 self)
 Add to MetaCart
The Global Positioning System can be used to give every terminal a geographic address for multicasting to and from recipients within specified geographical areas. 86 April 1999/Vol. 42, No. 4 COMMUNICATIONS OF THE ACMGPS cards will soon be included in cars manufactured in the U.S. and Europe and possibly in every other form of mobile computer as well. A user’s location will be another piece of information—as common as the date is today—getting input from the GPS when outdoors and from other locationproviding devices when indoors. The availability of location information will have a broad effect on both applicationlevel and networklevel software. Possible new services and functions include geographic messaging, advertising, and resource discovery. Geographic messaging is the ability to send a message selectively to specific geographic subareas defined by latitude and longitude—for example, sending an emergency message to everyone in a specific area, such as a building, train station, or highway. The ability to send a message to a distinct geographical area would
An optimal algorithm for intersecting threedimensional convex polyhedra
 SIAM J. Comput
, 1992
"... Abstract. This paper describes a lineartime algorithm for computing the intersection of two convex polyhedra in 3space. Applications of this result to computing intersections, convex hulls, and Voronoi diagrams are also given. Key words, computational geometry, convex polyhedra AMS(MOS) subject cl ..."
Abstract

Cited by 62 (4 self)
 Add to MetaCart
Abstract. This paper describes a lineartime algorithm for computing the intersection of two convex polyhedra in 3space. Applications of this result to computing intersections, convex hulls, and Voronoi diagrams are also given. Key words, computational geometry, convex polyhedra AMS(MOS) subject classifications. 68Q25, 68H05 1. Introduction. Giventwo
Optimal OutputSensitive Convex Hull Algorithms in Two and Three Dimensions
, 1996
"... We present simple outputsensitive algorithms that construct the convex hull of a set of n points in two or three dimensions in worstcase optimal O(n log h) time and O(n) space, where h denotes the number of vertices of the convex hull. ..."
Abstract

Cited by 45 (6 self)
 Add to MetaCart
We present simple outputsensitive algorithms that construct the convex hull of a set of n points in two or three dimensions in worstcase optimal O(n log h) time and O(n) space, where h denotes the number of vertices of the convex hull.
GPSBased Addressing and Routing
, 1996
"... In the near future GPS will be widely used, thus allowing a broad variety of location dependent services such as direction giving, navigation, etc. In this document we propose a family of protocols and addressing methods to integrate GPS into the Internet Protocol to enable the creation of location ..."
Abstract

Cited by 36 (3 self)
 Add to MetaCart
In the near future GPS will be widely used, thus allowing a broad variety of location dependent services such as direction giving, navigation, etc. In this document we propose a family of protocols and addressing methods to integrate GPS into the Internet Protocol to enable the creation of location dependent services. The solutions which we present are flexible (scalable) in terms of the target accuracy of the GPS. The main challenge is to integrate the concept of physical location into the current design of the Internet which relies on logical addressing. Two solutions are presented in this draft and a third solution is sketched. Figure 1: GPS Satellites Orbiting the Earth Contents 1 Introduction 3 1.1 Scenarios of Usage and Interface Issues : : : : : : : : : : : : : 4 2 Background 5 2.1 Related Work : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.2 Global Positioning System (GPS) : : : : : : : : : : : : : : : : 6 2.2.1 What is GPS? : : : : : : : : : : : : : : : : : : ...
DEEP: Dualspace Expansion for Estimating Penetration depth between convex polytopes
 In IEEE Conference on Robotics and Automation
, 2002
"... We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a "locally optimal solution" by walking on the surface of the Minkowski sums. The surface of the Minkowski sums is computed implicitly by constructing a local Gauss ..."
Abstract

Cited by 22 (7 self)
 Add to MetaCart
We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a "locally optimal solution" by walking on the surface of the Minkowski sums. The surface of the Minkowski sums is computed implicitly by constructing a local Gauss map. In practice, the algorithm works well when there is high motion coherence in the environment and is able to compute the optimal solution in most cases.
Computational geometry  a survey
 IEEE TRANSACTIONS ON COMPUTERS
, 1984
"... We survey the state of the art of computational geometry, a discipline that deals with the complexity of geometric problems within the framework of the analysis ofalgorithms. This newly emerged area of activities has found numerous applications in various other disciplines, such as computeraided de ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
We survey the state of the art of computational geometry, a discipline that deals with the complexity of geometric problems within the framework of the analysis ofalgorithms. This newly emerged area of activities has found numerous applications in various other disciplines, such as computeraided design, computer graphics, operations research, pattern recognition, robotics, and statistics. Five major problem areasconvex hulls, intersections, searching, proximity, and combinatorial optimizationsare discussed. Seven algorithmic techniques incremental construction, planesweep, locus, divideandconquer, geometric transformation, pruneandsearch, and dynamizationare each illustrated with an example.Acollection of problem transformations to establish lower bounds for geometric problems in the algebraic computation/decision model is also included.
A Simple Linear Algorithm for Intersecting Convex Polygons
 The Visual Computer
, 1985
"... Let P and Q be two convex polygons with m and n vertices, respectively, which are specified by their cartesian coordinates in order. A simple O(m+n) algorithm is presented for computing the intersection of P and Q. Unlike previous algorithms, the new algorithm consists of a twostep combination of t ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Let P and Q be two convex polygons with m and n vertices, respectively, which are specified by their cartesian coordinates in order. A simple O(m+n) algorithm is presented for computing the intersection of P and Q. Unlike previous algorithms, the new algorithm consists of a twostep combination of two simple algorithms for finding convex hulls and triangulations of polygons. Key words: Algorithms  Complexity  Computational geometry  Convex polygons  Intersection 1. Introduction Let P = {p 1 , p 2 ,..., p m } and Q = {q 1 , q 2 ,..., q n } be two convex polygons whose vertices are specified by their cartesian coordinates in clockwise order. It is assumed that the polygons are in standard form, i.e., the vertices of each polygon are distinct and no three consecutive vertices are collinear [7]. A common problem in computer graphics, image processing and many subproblems in computational geometry is that of computing the intersection of P and Q which is itself another c...
Incremental Penetration Depth Estimation Between Convex Polytopes Using Dualspace Expansion
, 2004
"... We present a fast algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a "locally optimal solution" by walking on the surface of the Minkowski sums. The surface of the Minkowski sums is computed implicitly by constructing a local dual mappin ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We present a fast algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a "locally optimal solution" by walking on the surface of the Minkowski sums. The surface of the Minkowski sums is computed implicitly by constructing a local dual mapping on the Gauss map. We also present three heuristic techniques that are used to estimate the initial features used by the walking algorithm. We have implemented the algorithm and compared its performance with earlier approaches. In our experiments, the algorithm is able to estimate the penetration depth in about a millisecond on an 1 GHz Pentium PC. Moreover, its performance is almost independent of model complexity in environments with high coherence between successive instances.