Michael B. Dillencourt, et al.  Home/Search
Context Related
| nec.com/homepages/...ivalentinscrib.ps uci.edu/~dillenco/pu...triinscrib.ps.gz uci.edu./~dillenco/p...triinscrib.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nec.com/homepages/w...journalpubs (more) From: uci.edu/~dillenco/pubs/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an algorithm for testing the inscribability of a trivalent polyhedron or, equivalently, testing the circumscribability of a simplicial polyhedron. Our algorithm, which runs in linear time and uses only low-precision integer arithmetic, is based on a purely combinatorial characterization of inscribable trivalent polyhedra. 1. Introduction A polyhedron is inscribable if it is combinatorially equivalent to the edges and vertices of the convex hull of a set of noncoplanar points on the ... (Update)
Context of citations to this paper: More
.... case time complexity [3, 4, 6] Enumeration of subgraphs has a number of uses, including a recent application in testing inscribability [5]. These results naturally raise the question of determining which other planar graphs occur O(n) times as subgraphs of planar graphs. A...
.... a decomposition can be constructed in linear time [4, 17] Optimal triangulation construction [3] and certain planar graph computations [8] require a listing of all triangles. Related subgraph isomorphism problems also occur in a wide variety of practical applications [2, 5, 12,...
Cited by: More
Subgraph Isomorphism in Planar Graphs and Related Problems - Eppstein (1999) (Correct)
Advances in the Theory and Practice of Graph Drawing - Tamassia (1996) (Correct)
On the Enumeration of Inscribable Graphs - Smith (1991) (Correct)
Active bibliography (related documents): More All
2.6: Graph-Theoretical Conditions for Inscribability and.. - Dillencourt, Smith (1995) (Correct)
0.8: Finding Hamiltonian Cycles in Delaunay Triangulations Is.. - Dillencourt (1994) (Correct)
0.7: A Simple Method for Completing Degenerate Delaunay.. - Dillencourt, Smith (1997) (Correct)
Similar documents based on text: More All
0.4: Retrospective sketch of Warren D. Smith's research 1990-1998 - Warren Smith Wds (Correct)
0.2: The IHX-Type Relations On Trivalent Graphs And Symplectic .. - Garoufalidis, Nakamura (1998) (Correct)
0.2: Finite Type 3-Manifold Invariants And The Structure Of The .. - Garoufalidis, Levine (1997) (Correct)
Related documents from co-citation: More All
6: Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
5: Embedding planar graphs on the grid (context) - Schnyder - 1990
5: visualization of program information (context) - Reiss - 1995
BibTeX entry: (Update)
M. B. Dillencourt and W. D. Smith. A linear-time algorithm for testing the inscribability of trivalent polyhedra. International Journal of Computational Geometry & Applications, 5(1--2):21--36, March--June 1995. http://citeseer.ist.psu.edu/dillencourt95lineartime.html More
@article{ dillencourt95lineartime,
author = "Michael B. Dillencourt and Warren D. Smith",
title = "A linear-time algorithm for testing the inscribability of trivalent polyhedra",
journal = "International Journal of Computational Geometry and Applications",
volume = "5",
pages = "21-36",
year = "1995",
url = "citeseer.ist.psu.edu/dillencourt95lineartime.html" }
Citations (may not include all citations):1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
98 volume 10 of EATCS Monographs on Theoretical Computer Scienc.. (context) - Edelsbrunner, Combinatorial - 1987
72 Unsolved Problems in Geometry (context) - Croft, Falconer et al. - 1991
47 Voronoi diagrams from convex hulls (context) - Brown - 1979
27 Wiley Interscience (context) - Grunbaum - 1967
24 Tough graphs and Hamiltonian circuits (context) - Chv'atal - 1973
9 A characterization of ideal polyhedra in hyperbolic 3-space (context) - Rivin - 1992
9 Toughness and Delaunay triangulations (context) - Dillencourt - 1990
7 Graph-theoretical conditions for inscribability and Delaunay.. - Dillencourt, Smith - 1992
5 NEC Research Institute (context) - Rivin, Smith et al. - 1991
5 volume 32 of Annals of Discrete Mathematics (context) - Nishizeki, Chiba et al. - 1988
4 On geometry of convex ideal polyhedra in hyperbolic 3-space (context) - Rivin - 1993
4 Polyhedra of small order and their Hamiltonian properties (context) - Dillencourt - 1992
4 A characterization of compact convex polyhedra in hyperbolic.. (context) - Hodgson, Rivin - 1993
3 A simple method for resolving degeneracies in Delaunay trian.. (context) - Dillencourt, Smith - 1993
2 Descartes on Polyhedra: A study of the De Solidorum Elementi.. (context) - Federico - 1982
2 Some problems on polyhedra (context) - Grunbaum, Shephard - 1987
2 Systematische Entwicklung der Abhangigkeit geometrischer Ges.. (context) - Steiner
1 A polynomial-time algorithm for deciding the inscribability .. (context) - Smith - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.neci.nj.nec.com/homepages/wds/journalpubs.html): More
Three disproofs of the Gilbert-Pollak conjecture on Steiner.. - Du, Smith (1994) (Correct)
Graph-Theoretical Conditions for Inscribability and.. - Dillencourt, Smith (1995) (Correct)
The uniqueness of the maximum and minimum functions for AND.. - Warren Smith (Correct)
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