J. E. Goodman, J. O'Rourke (eds.). Handbook Of Discrete And Computational Geometry, CRC Press, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Inapproximability of Finding Maximum Hidden Sets on Polygons and .. - Eidenbenz (2002) (Correct)
..... There are 2 holes for each edge in the graph and each hole consists of 3 vertices. Therefore, the polygon consists of 6m 2n vertices. It is known in computational geometry that the coordinates of intersection points of lines with rational coefficients can be expressed with polynomial length [8]. All of the points in our construction are of this type. Therefore, the construction is polynomial. The transformation of a feasible solution can obviously be done in polynomial time. We obtain our inapproximability result, again, by using the technique of gap preserving reductions, which ....
J.E. Goodman, J. O'Rourke (Eds.), Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, FL, 1997.
Selecting Forwarding Neighbors in - Wireless Ad Hoc (Correct)
....the Voronoi diagram of A v , and preprocess the diagram for membership queries. A membership query returns, for a give point p, the face of the Voronoi diagram where p lies. The preprocessing time for constructing the Voronoi diagrams is O(n log n) per level in T (see, for example, Chapter 20.2 of [8]) for a total of O(n log n) The space requirement is O(n) per level of T , for a total of O(n log n) Preprocessing a node v for membership queries also takes time O(jA v j log jA v j) and space O(jA v j) and a query can be answered in time O(log jA v j) see, for example, Chapter 30.3 of ....
.... [8] for a total of O(n log n) The space requirement is O(n) per level of T , for a total of O(n log n) Preprocessing a node v for membership queries also takes time O(jA v j log jA v j) and space O(jA v j) and a query can be answered in time O(log jA v j) see, for example, Chapter 30.3 of [8]) The total time is O(n log n) and the total space is O(n log n) With this data structure, given any node v in T , and a point p, one can find whether a disk in the subtree rooted at v covers p in time O(log n) by finding out in which cell of the Voronoi diagram of A v p lies, and ....
[Article contains additional citation context not shown here]
J. E. Goodman and J. O'Rourke (editors), Handbook of Discrete and Computational Geometry, CRC Press, 1997.
Efficient Consistency Proofs on a Committed Database - Ostrovsky, Rackoff, Smith (2003) (Correct)
.... this is a triple (D, is a set of possible queries, and Q is a rule Note that despite the algorithmic flavor of the question, the error model is indeed cryptographic (i.e. adversarial) Note that the most efficient normal algorithm for range queries has complexity O( m 1) log N) [13]. We do not know how to make it data robust, however, without increasing the complexity by a factor of log N . which associates an answer a q,D = Q(q, D) with every query database pair q # D. Suppose we have a query structure (D, Q) A data robust algorithm (DRA) for these consists of ....
....D whose key (xkey, ykey) lies in q. In this section we give a simple, efficient DRA for range queries and show how to modify it to make an efficient consistent query protocol. 5. 1 A data robust algorithm for range queries Various data structures for efficient orthogonal range queries exist (see [13] for a survey) The most efficient (non robust) solutions have query time O( m 1) log N) for d dimensional queries. In this section we recall the construction of multi dimensional range trees (due to Bentley [3] and show how they can be queried robustly. The query time of the robust ....
[Article contains additional citation context not shown here]
J. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, 1997. 24
Approximate Symmetry Detection For Reverse Engineering - Mills Langbein Marshall (2001) (1 citation) (Correct)
No context found.
J. E. Goodman, J. O'Rourke (eds.). Handbook Of Discrete And Computational Geometry, CRC Press, 1997.
A Sample-based Convex Cover for Rapidly Finding - An Object In (Correct)
No context found.
Goodman, J.E. and J. O'Rourke, Handbook of Discrete and Computational Geometry, CRC Press, 1997.
A Multi-robot Strategy for Rapidly Searching - Polygonal Environment Alejandro (Correct)
No context found.
Goodman, J.E. and J. O'Rourke, Handbook of Discrete and Computational Geometry, CRC Press, 1997.
A Near-Tight Approximation Lower Bound and Algorithm for.. - Koenig, Mudgal, Tovey (Correct)
No context found.
J.E. Goodman and J. O'Rourke, Handbook of Discrete and Computational Geometry, Chap. 25, CRC Press 1997.
Representation and Querying of Interpolation Data in.. - Databases Peter Revesz (2002) (Correct)
No context found.
J. E. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton, New York, 1997.
The Relationship among GIS-Oriented Spatiotemporal Databases - Lixin Li And (2003) (Correct)
No context found.
J. E. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton, New York, 1997.
Fixed-Point Query Languages for Linear Constraint Databases - Kreutzer (2000) (3 citations) (Correct)
No context found.
J. E. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, 1997.
The Relationship among GIS-Oriented Spatiotemporal Databases - Lixin Li And (2003) (Correct)
No context found.
J. E. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton, New York, 1997.
Planning Algorithms - LaValle (2004) (3 citations) (Correct)
No context found.
J. E. Goodman and J. O'Roarke. Handbook of Discrete and Computational Geometry. CRC Press, New York, 1997.
Efficient Consistency Proofs for Generalized Queries on.. - Ostrovsky, Rackoff.. (2004) (Correct)
No context found.
J. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, 1997.
Marketecture: A Simulation-Based Framework for.. - Atkins, Barrett.. (2004) (Correct)
No context found.
J. E. Goodman and J. O'Rourke. Handbook of Discrete and Computational Geometry. CRC Press, (1997).
Efficient Consistency Proofs for Generalized Queries on.. - Ostrovsky, Rackoff.. (2004) (Correct)
No context found.
J. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, 1997.
Approximate Congruence Detection of Model Features.. - Gao, Langbein.. (2003) (Correct)
No context found.
J. E. Goodman, J. O'Rourke (eds), Handbook of Discrete and Computational Geometry, CRC Press, 1997.
Bulk Synchronous Parallel Algorithms for the.. - Dehne, Dittrich.. (2002) (2 citations) (Correct)
No context found.
J. E. Goodman and J. O'Rurke (editors). Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton, FL, 1997.
Visual Servoing from Lines - Andreff, Espiau, Horaud (2001) (6 citations) (Correct)
No context found.
J. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, 1997.
An Image-Based Framework for Animated Non-Photorealistic Rendering - Klein (2002) (Correct)
No context found.
J. E. Goodman and J. O'Rourke. Handbook of Discrete and Computational Geometry. CRC Press, New York, 1997.
Efficient Consistency Proofs for Generalized Queries on.. - Ostrovsky, Rackoff.. (2004) (Correct)
No context found.
J. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, 1997.
Analysis of Half-Space Range Search Using the k-d Search Skip.. - Lopez, Nickerson (Correct)
No context found.
J.E. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry, chapter 31. CRC Press, Boca Raton, 1997.
Fast Absolute Irreducibility Testing via Newton Polytopes - Gao, Lauder (2000) (Correct)
No context found.
J.E. Goodman and J. O'Rourke (Eds), Handbook of Discrete and Computational Geometry, Elsevier Science, Amsterdam, 1997.
Efficient Consistency Proofs for Generalized Queries on.. - Ostrovsky, Rackoff.. (2004) (Correct)
No context found.
J. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, 1997.
Eliminating Duplicates - Under Interval And (2002) (Correct)
No context found.
Goodman, J.E., and O'Rourke, J., 1997. Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, Florida.
Counting Points on Varieties over Finite Fields of Small.. - Lauder, Wan (2001) (3 citations) (Correct)
No context found.
J.E. Goodman and J. O'Rourke (Eds), Handbook of Discrete and Computational Geometry, CRC Press, 1997.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC