Title: *
Title2: *
Author: *
Author2: *
Any Field: visibility
Any Field2: graph
Year: *
62 Results:
@article{ae-vgspu-93
, author = "J. Abello and {\"O}.
E{\~g}ecio{\~g}lu"
, title = "Visibility graphs
of staircase polygons with uniform step length"
, journal = "Internat. J. Comput. Geom.
Appl."
, volume = 3
, year = 1993
, pages = "27--37"
, keywords = "visibility graph, staircase
polygon, orthogonal convex fan, uniform step length"
, succeeds = "ae-vgspu-91"
, update = "98.07 bibrelex, 96.09
devillers"
}
@inproceedings{ak-vgom-95
, author = "J. Abello and K. Kumar"
, title = "Visibility Graphs
and Oriented Matroids"
, editor = "R. Tamassia and I.
G. Tollis"
, booktitle = "Graph Drawing (Proc. GD '94)"
, series = "Lecture Notes Comput.
Sci."
, volume = 894
, publisher = "Springer-Verlag"
, year = 1995
, pages = "147--158"
, keywords = "graph drawing, visibility"
, update = "95.01 tamassia"
}
@inproceedings{agg-u3dvr-96
, author = "H. Alt and M. Godau
and S. Whitesides"
, title = "Universal 3-Dimensional
Visibility Representations for Graphs"
, editor = "F. J. Brandenburg"
, booktitle = "Graph Drawing (Proc. GD '95)"
, series = "Lecture Notes Comput.
Sci."
, volume = 1027
, publisher = "Springer-Verlag"
, year = 1996
, pages = "8--19"
, keywords = "graph drawing, visibility, 3D"
, precedes = "aag-u3dvr-98"
, update = "98.11 devillers+patrignani,
96.09 tamassia"
}
@article{agw-u3dvr-98
, author = "Helmut Alt and Michael
Godau and Sue Whitesides"
, title = "Universal $3$-Dimensional
Visibility Representations for Graphs"
, journal = "Comput. Geom. Theory Appl."
, volume = 9
, year = 1998
, pages = "111--125"
, note = "(special
issue on Graph Drawing, edited by G.~{Di Battista} and R.~Tamassia)"
, keywords = "graph drawing, visibility, 3D"
, succeeds = "agg-u3dvr-96"
, update = "98.11 devillers+patrignani"
}
@article{a-srvg-92
, author = "T. Andreae"
, title = "Some Results
on Visibility Graphs"
, journal = "Discrete Appl. Math."
, volume = 40
, year = 1992
, pages = "5--17"
, keywords = "graph drawing"
, succeeds = "a-srvg-89"
, update = "98.07 bibrelex, 94.01
tamassia"
}
@inproceedings{aaghi-vpses-85
, author = "Ta. Asano and Te.
Asano and Leonidas J. Guibas and J. Hershberger and H. Imai"
, title = "Visibility-polygon
search and {Euclidean} shortest paths"
, booktitle = "Proc. 26th Annu. IEEE Sympos. Found.
Comput. Sci."
, year = 1985
, pages = "155--164"
, precedes = "aaghi-vdp-86"
, update = "98.03 mitchell"
, annote = "$O(n^2)$ time and
space algorithm builds visibility
graph of polygonal set. Hence $O(n^2)$ shortest path
algorithm."
}
@inproceedings{a-vgsls-96
, author = "Y. Atassi"
, title = "Visibility graph
of a set of line sements: {A} dynamic sequential algorithm and its parallel
version"
, booktitle = "Proc. 8th Canad. Conf. Comput. Geom."
, year = 1996
, pages = "246--251"
, update = "97.03 agarwal, 96.09
mitchell"
}
@inproceedings{bo-dpo-88
, author = "M. de Berg and M.
Overmars"
, title = "Dominance in
the presence of obstacles"
, booktitle = "Proc. 14th Internat. Workshop Graph-Theoret.
Concepts Comput. Sci."
, nickname = "WG '88"
, series = "Lecture Notes Comput.
Sci."
, volume = 344
, publisher = "Springer-Verlag"
, year = 1988
, pages = "190--201"
, keywords = "domination, maximal elements,
rectangular visibility"
}
@incollection{beflmrsw-ovrg3d-94
, author = "P. Bose and H. Everett
and S{\'a}ndor P. Fekete and A. Lubiw and H. Meijer and K. Romanik and
T. Shermer and S. Whitesides"
, title = "On a Visibility
Representation for Graphs in Three Dimensions"
, editor = "D. Avis and P. Bose"
, booktitle = "Snapshots in Computational and Discrete
Geometry, Volume III"
, publisher = "McGill University"
, month = jul
, year = 1994
, pages = "2--25"
, note = "McGill technical
report SOCS-94.50"
, keywords = "graph drawing, visibility"
, precedes = "behflmrrswz-vrg3d-98"
, update = "98.07 rote, 98.03
mitchell, 97.03 rote, 96.09 romanik"
}
@article{behflmrrswz-vrg3d-98
, author = "P. Bose and H. Everett
and Michael E. Houle and S{\'a}ndor P. Fekete and A. Lubiw and H. Meijer
and K. Romanik and G{\"u}nter Rote and T. Shermer and S. Whitesides and
Christian Zelle"
, title = "A visibility
representation for graphs in three dimensions"
, journal = "J. Graph Algorithms Appl."
, volume = 2
, number = 3
, year = 1998
, pages = "1--16"
, keywords = "graph drawing, visibility"
, succeeds = "beflmrsw-ovrg3d-94, fhw-nrvrg-96"
, update = "98.07 rote, 98.03
mitchell, 97.11 orourke, 97.03 rote"
, abstract = "We propose a 3-dimensional visibility
representation of graphs
in which vertices are mapped to horizontal axis-parallel
rectangles floating in 3-space, with edges represented by
vertical lines of sight. We apply an extension of the
{Erd\H os}-Szekeres Theorem in a geometric setting to obtain an
upper bound of 56 for size of the largest complete graph which
is representable. On the other hand, we construct a
representation of the complete graph with 22 vertices.
These are the best existing bounds."
}
@incollection{bjmo-kibvg-94
, author = "P. Bose and A. Josefczyk
and J. Miller and J. O'Rourke"
, title = "{$K_{42}$} is
a box visibility graph"
, booktitle = "Snapshots of Computational and Discrete
Geometry"
, volume = 3
, publisher = "School Comput. Sci., McGill Univ."
, address = "Montreal, PQ"
, month = jul
, year = 1994
, pages = "88--91"
, note = "Technical
Report SOCS-94.50"
, keywords = "visibility graphs"
, comments = "Also Technical Report 035, Dept.
Comput. Sci., Smith College"
, update = "94.09 orourke"
}
@article{cn-ozr-87
, author = "W.-P. Chin and S.
Ntafos"
, title = "Optimum zookeeper
routes"
, journal = "Congr. Numer."
, volume = 58
, year = 1987
, pages = "257--266"
, note = "Combinatorics,
Graph Theory and Computing. Proc. 20th South-East Conf., Boca Raton"
, keywords = "visibility"
, update = "95.09 korneenko"
}
@article{csc-crvgf-95
, author = "S. H. Choi and S.
Y. Shin and K. Y. Chwa"
, title = "Characterizing
and Recognizing the Visibility Graph of a Funnel-Shaped Polygon"
, journal = "Algorithmica"
, volume = 14
, year = 1995
, pages = "27--51"
, update = "95.09 smid"
}
@article{cfhz-cvsov-98
, author = "D. Cohen-Or and G.
Fibich and D. Halperin and E. Zadicario"
, title = "Conservative
visibility and strong occlusion for viewspace partitioning of densely occluded
scenes"
, journal = "Comput. Graph. Forum"
, volume = 17
, year = 1998
, pages = "C243--C253"
, note = "Eurographics
'98"
, update = "98.11 halperin"
}
@inproceedings{d-vgcbd-97
, author = "Gautam Das"
, title = "The Visibility
Graph Contains a Bounded-Degree Spanner"
, booktitle = "Proc. 9th Canad. Conf. Comput. Geom."
, year = 1997
, pages = "70--75"
, update = "97.11 jones"
}
@inproceedings{dh-rvrbg-95
, author = "A. M. Dean and J.
P. Hutchinson"
, title = "Rectangle-Visibility
Representations of Bipartite Graphs"
, editor = "R. Tamassia and I.
G. Tollis"
, booktitle = "Graph Drawing (Proc. GD '94)"
, series = "Lecture Notes Comput.
Sci."
, volume = 894
, publisher = "Springer-Verlag"
, year = 1995
, pages = "159--166"
, keywords = "graph drawing, visibility"
, update = "95.01 tamassia"
}
@article{dtt-cvrg-92
, author = "G. {Di Battista} and
R. Tamassia and I. G. Tollis"
, title = "Constrained Visibility
Representations of Graphs"
, journal = "Inform. Process. Lett."
, volume = 41
, year = 1992
, pages = "1--7"
, keywords = "graph drawing"
, update = "93.09 tamassia"
}
@article{eow-sgrag-84
, author = "H. Edelsbrunner and
J. O'Rourke and Emo Welzl"
, title = "Stationing guards
in rectilinear art galleries"
, journal = "Comput. Vision Graph. Image
Process."
, volume = 27
, year = 1984
, pages = "167--176"
, keywords = "design of algorithms, construction,
decomposition, visibility, subdivisions, polygons, $c$-oriented, two-dimensional"
, update = "98.11 bibrelex, 98.03
mitchell"
}
@techreport{e-vgr-90
, author = "H. Everett"
, title = "Visibility Graph
Recognition"
, type = "Report"
, number = "231/90"
, institution = "Dept. Comput. Sci., Univ. Toronto"
, address = "Toronto, ON"
, year = 1990
, note = "Ph.D. Thesis"
, update = "96.09 orourke"
}
@inproceedings{fhw-nrvrg-96
, author = "S{\'a}ndor P. Fekete
and M. E. Houle and S. Whitesides"
, title = "New results on
a visibility representation of graphs in 3-D"
, editor = "F. Brandenburg"
, booktitle = "Graph Drawing (Proc. GD '95)"
, series = "Lecture Notes Comput.
Sci."
, volume = 1027
, publisher = "Springer-Verlag"
, year = 1996
, pages = "234--241"
, keywords = "visibility graphs"
, precedes = "behflmrrswz-vrg3d-98"
, update = "98.11 bibrelex, 98.07
rote, 98.03 mitchell, 97.03 rote, 96.09 orourke"
}
@article{gh-cvgnl-85
, author = "Leonidas J. Guibas
and J. Hershberger"
, title = "Computing the
visibility graph of $n$ line segments in {$O(n^{2})$} time"
, journal = "Bull. EATCS"
, volume = 26
, year = 1985
, pages = "13--20"
, update = "98.03 mitchell"
}
@inproceedings{hk-reldp-95
, author = "X. He and M.-Y. Kao"
, title = "Regular Edge
Labelings and Drawings of Planar Graphs"
, editor = "R. Tamassia and I.
G. Tollis"
, booktitle = "Graph Drawing (Proc. GD '94)"
, series = "Lecture Notes Comput.
Sci."
, volume = 894
, publisher = "Springer-Verlag"
, year = 1995
, pages = "96--103"
, keywords = "graph drawing, planar, straight-line,
visibility, survey"
, update = "95.01 tamassia"
}
@inproceedings{h-fvgsp-87
, author = "J. Hershberger"
, title = "Finding the visibility
graph of a simple polygon in time proportional to its size"
, booktitle = "Proc. 3rd Annu. ACM Sympos. Comput.
Geom."
, year = 1987
, pages = "11--20"
, cites = "aaghi-vdp-86,
b-prcv-75, cg-vippg-85, ci-tsc-84, gjpt-tsp-78, ghlst-ltavs-86, gmpr-nrll-77,
gs-pmgsc-85, hm-ftsp-83, hm-ndsrs-82, tv-otats-86, a-jschc-87, ZZZ"
, update = "98.03 bibrelex"
}
@article{h-fvgsp-89
, author = "J. Hershberger"
, title = "Finding the Visibility
Graph of a Simple Polygon in Time Proportional to its Size"
, journal = "Algorithmica"
, volume = 4
, year = 1989
, pages = "141--155"
, succeeds = "gh-ospqs-89"
, update = "97.11 bibrelex"
}
@techreport{hn-tvgrv-93t
, author = "F. Hurtado and M.
Noy"
, title = "Triangulations,
Visibility Graph and Reflex Vertices of a Simple Polygon"
, number = "MA2-IR-93-2"
, institution = "Dept. Applied Mathematics, U. Polit\`ecnica
de Catalunya, Spain"
, month = feb
, year = 1993
, precedes = "hn-tvgrv-96"
, update = "97.11 icking, 97.03
devillers, 93.09 held"
}
@inproceedings{hn-tvgrv-93i
, author = "Ferran Hurtado and
M. Noy"
, title = "Triangulations,
Visibility Graph and Reflex Vertices of a Simple polygon"
, booktitle = "Abstracts 9th European Workshop Comput.
Geom."
, nickname = "CG '93"
, site = "Hagen"
, year = 1993
, pages = "36--39"
, update = "98.07 bibrelex, 97.11
icking, 93.09 milone+mitchell"
}
@article{hn-tvgrv-96
, author = "F. Hurtado and M.
Noy"
, title = "Triangulations,
Visibility Graph and Reflex Vertices of a Simple Polygon"
, journal = "Comput. Geom. Theory Appl."
, volume = 6
, year = 1996
, pages = "355--369"
, succeeds = "hn-tvgrv-93t, hn-tvgrv-93i"
, update = "98.03 bibrelex, 97.03
devillers"
}
@inproceedings{hsv-rsttg-95
, author = "J. P. Hutchinson and
T. Shermer and A. Vince"
, title = "On representations
of some thickness-two graphs"
, editor = "F. Brandenburg"
, booktitle = "Graph Drawing (Proc. GD '95)"
, series = "Lecture Notes Comput.
Sci."
, volume = 1027
, publisher = "Springer-Verlag"
, year = 1995
, pages = "324--332"
, keywords = "visibility graphs"
, update = "98.11 bibrelex, 97.11
orourke, 96.09 orourke"
}
@inproceedings{k-mcvr-93
, author = "G. Kant"
, title = "A More Compact
Visibility Representation"
, editor = "J. van Leeuwen"
, booktitle = "Proc. 19th Internat. Workshop Graph-Theoret.
Concepts Comput. Sci."
, nickname = "WG '93"
, series = "Lecture Notes Comput.
Sci."
, publisher = "Springer-Verlag"
, year = 1993
, precedes = "k-mcvr-97"
, update = "98.11 bibrelex, 98.07
bibrelex, 97.07 devillers, 94.01 tamassia, 93.09 milone+mitchell"
}
@article{kltt-arvrt-97
, author = "G. Kant and G. Liotta
and R. Tamassia and I. G. Tollis"
, title = "Area Requirement
of Visibility Representations of Trees"
, journal = "Inform. Process. Lett."
, volume = 62
, number = 2
, year = 1997
, pages = "81--88"
, url = "http://www.cs.brown.edu/cgc/papers/kltt-arvrt-97.ps.gz"
, keywords = "graph drawing, visibility, tree,
CGC, Brown"
, update = "98.11 tamassia, 97.03
tamassia"
}
@techreport{kltt-vrt-96
, author = "G. Kant and G. Liotta
and R. Tamassia and I. G. Tollis"
, title = "Visibility Representations
of Trees"
, type = "Technical
Report"
, number = "CS-96-23"
, institution = "Center for Geometric Computing, Dept. Computer
Science, Brown Univ."
, year = 1996
, url = "ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-23.ps.Z"
, keywords = "graph drawing, visibility, tree,
CGC, Brown"
, update = "97.03 tamassia"
}
@inproceedings{kku-ndvrg-95
, author = "E. Kranakis and D.
Krizanc and J. Urrutia"
, title = "On the Number
of Directions in Visibility Representations of Graphs"
, editor = "R. Tamassia and I.
G. Tollis"
, booktitle = "Graph Drawing (Proc. GD '94)"
, series = "Lecture Notes Comput.
Sci."
, volume = 894
, publisher = "Springer-Verlag"
, year = 1995
, pages = "167--176"
, keywords = "graph drawing, visibility"
, update = "95.01 tamassia"
}
@article{l-vsp-83
, author = "D. T. Lee"
, title = "Visibility of
a simple polygon"
, journal = "Comput. Vision Graph. Image
Process."
, volume = 22
, year = 1983
, pages = "207--221"
}
@article{ll-cvpe-86
, author = "D. T. Lee and A. K.
Lin"
, title = "Computing the
visibility polygon from an edge"
, journal = "Comput. Vision Graph. Image
Process."
, volume = 34
, year = 1986
, pages = "1--19"
, update = "93.09 milone+mitchell"
}
@article{ls-cavg-95
, author = "Y. Lin and Steven
S. Skiena"
, title = "Complexity aspects
of visibility graphs"
, journal = "Internat. J. Comput. Geom.
Appl."
, volume = 5
, year = 1995
, pages = "289--312"
, keywords = "graph drawing, visibility graphs,
polygons, area requirements, outerplanar graphs, isomorphism, independent
sets"
, succeeds = "ls-cavg-92"
, update = "98.03 mitchell, 96.09
devillers"
}
@article{lmw-nvg-87
, author = "F. Luccio and S. Mazzone
and C. Wong"
, title = "A Note on Visibility
Graphs"
, journal = "Discrete Math."
, volume = 64
, year = 1987
, pages = "209--219"
, keywords = "graph drawing"
, update = "94.01 tamassia, 93.09
tamassia"
}
@article{m-wcohs-87
, author = "M. McKenna"
, title = "Worst-case optimal
hidden-surface removal"
, journal = "ACM Trans. Graph."
, volume = 6
, year = 1987
, pages = "19--28"
, keywords = "design of algorithms, complexity
theory, computer graphics, visibility, plane-sweep, hidden line/surface
elimination"
}
@techreport{mw-dmvgi-90
, author = "Joseph S. B. Mitchell
and Emo Welzl"
, title = "Dynamically Maintaining
a Visibility Graph under Insertions of New Obstacles"
, institution = "Operations Research, Cornell University"
, year = 1990
, update = "98.03 mitchell"
}
@inproceedings{nt-cledv-90
, author = "J. Nummenmaa and J.
Tuomi"
, title = "Constructing
Layouts for {ER}-Diagrams from Visibility Representations"
, booktitle = "Proc. 9th Internat. Conf. on Entity-Relationship
Approach"
, year = 1990
, pages = "303--317"
, keywords = "graph drawing"
, update = "93.09 tamassia"
}
@techreport{os-vevgp-96
, author = "J. O'Rourke and I.
Streinu"
, title = "The Vertex-Edge
Visibility Graph of a Polygon"
, type = "Technical
{Report}"
, number = 047
, institution = "Dept. Comput. Sci., Smith College"
, address = "Northampton, MA"
, month = jun
, year = 1996
, note = "Revised
Feb. 1997"
, update = "97.03 orourke"
}
@article{os-vevgp-97
, author = "J. O'Rourke and I.
Streinu"
, title = "The vertex-edge
visibility graph of a polygon"
, journal = "Comput. Geom. Theory Appl."
, volume = 8
, year = 1997
, pages = "1--17"
, keywords = "visibility, geometric graphs"
, succeeds = "os-pvgpp1-96"
, update = "98.07 bibrelex, 97.07
orourke"
, annote = "A new polygon visibility
graph is introduced. It is
demonstrated that it encodes more geometric
information about the polygon than does the vertex
visibility graph. For example, it determines the
shortest path tree for each vertex."
}
@article{os-vevgp-98
, author = "Joseph O'Rourke and
Ileana Streinu"
, title = "The vertex--edge
visibility graph of a polygon"
, journal = "Comput. Geom. Theory Appl."
, volume = 10
, year = 1998
, pages = "105--120"
, update = "98.11 devillers"
}
@article{pd-voag-90
, author = "H. Plantinga and C.
R. Dyer"
, title = "Visibility, occlusion,
and the aspect graph"
, journal = "Internat. J. Comput. Vision"
, volume = 5
, number = 2
, year = 1990
, pages = "137--160"
, update = "93.09 rote"
}
@inproceedings{pv-cvgpt-95
, author = "M. Pocchiola and G.
Vegter"
, title = "Computing the
Visibility Graph via Pseudo-Triangulations"
, booktitle = "Proc. 11th Annu. ACM Sympos. Comput.
Geom."
, year = 1995
, pages = "248--257"
, keywords = "topological sweep, visibility
complex"
, cites = "ce-oails-92,
eg-tsa-89, gt-ltasc-85, gm-osacv-91, hmrt-sjslt-86, ow-nmcvg-88, pv-vc-93,
s-ec-86, w-cvgnl-85, ZZZ"
, update = "98.03 bibrelex, 96.05
pocchiola, 95.09 mitchell"
}
@article{pv-tsvcpt-96
, author = "M. Pocchiola and G.
Vegter"
, title = "Topologically
sweeping visibility complexes via pseudo-triangulations"
, journal = "Discrete Comput. Geom."
, volume = 16
, month = dec
, year = 1996
, pages = "419--453"
, keywords = "topological sweep, visibility
complex, visibility graph, triangulation, pseudo-triangulation"
, succeeds = "pv-cvgpt-95"
, update = "97.03 pocchiola, 96.05
pocchiola"
}
@techreport{r-nhvg-91
, author = "J. Rippel"
, title = "A non-{Hamiltonian}
visibility graph"
, number = 009
, institution = "Smith College"
, year = 1991
, update = "93.09 milone+mitchell"
}
@inproceedings{r-tsvcp-95
, author = "St{\'e}phane Rivi{\`e}re"
, title = "Topologically
Sweeping the Visibility Complex of Polygonal Scenes"
, booktitle = "Proc. 11th Annu. ACM Sympos. Comput.
Geom."
, year = 1995
, pages = "C36--C37"
, keywords = "visibility graph optimal algorithm,
experimental"
, cites = "eg-tsa-86, gm-osacv-87,
ow-nmcvg-88, pv-savgc-93, pv-vc-93, pv-cvgpt-95, r-ectac-93, ZZZ"
, update = "98.07 icking, 98.03
bibrelex, 95.09 mitchell"
}
@inproceedings{r-drvgh-95
, author = "Kathleen Romanik"
, title = "Directed Rectangle-Visibility
Graphs have Unbounded Dimension"
, booktitle = "Proc. 7th Canad. Conf. Comput. Geom."
, year = 1995
, pages = "163--167"
, keywords = "graph drawing, visibility, order"
, comments = "To appear in Discrete Appl.
Math."
, update = "96.09 romanik, 95.09
jones"
}
@inproceedings{r-dvrgh-95
, author = "K. Romanik"
, title = "Directed VR-Representable
Graphs have Unbounded Dimension"
, editor = "R. Tamassia and I.
G. Tollis"
, booktitle = "Graph Drawing (Proc. GD '94)"
, series = "Lecture Notes Comput.
Sci."
, volume = 894
, publisher = "Springer-Verlag"
, year = 1995
, pages = "177--181"
, keywords = "graph drawing, visibility, order"
, update = "95.01 tamassia"
}
@incollection{slmlw-vpvlc-84
, author = "M. Schlag and F. Luccio
and P. Maestrini and D. T. Lee and C. K. Wong"
, title = "A visibility
problem in {VLSI} layout compaction"
, editor = "F. P. Preparata"
, booktitle = "VLSI Theory"
, series = "Adv. Comput. Res."
, volume = 2
, publisher = "JAI Press"
, address = "London, England"
, year = 1984
, pages = "259--282"
, keywords = "graph drawing"
, update = "97.11 bibrelex"
}
@inproceedings{s-cgavp-93
, author = "Thomas Shermer"
, title = "The continuous-graph
approach to visibility problems"
, booktitle = "Proc. 5th Canad. Conf. Comput. Geom."
, site = "Waterloo,
Canada"
, year = 1993
, pages = 321
, update = "93.09 milone+mitchell"
}
@article{sd-fbcve-95
, author = "S. X. Sillion and
G. Drettakis"
, title = "Feature-based
control of visibility error: {A} multi-resolution clustering algorithm
for global illumination"
, journal = "Comput. Graph."
, volume = "??"
, year = 1995
, note = "Proc. SIGGRAPH
'95"
, update = "98.07 bibrelex"
}
@article{s-fhcap-98
, author = "A. J. Stewart"
, title = "Fast Horizon
Computation at All Points of a Terrain with Visibility and Shading Applications"
, journal = "IEEE Trans. Visualizat.
Comput. Graph."
, volume = 4
, number = 1
, month = jan
, year = 1998
, pages = "82--93"
, update = "98.07 held"
}
@article{tt-uavrp-86
, author = "R. Tamassia and I.
G. Tollis"
, title = "A Unified Approach
to Visibility Representations of Planar Graphs"
, journal = "Discrete Comput. Geom."
, volume = 1
, number = 4
, year = 1986
, pages = "321--341"
, keywords = "graph drawing"
, update = "93.09 tamassia"
}
@inproceedings{tt-cgvc-87
, author = "R. Tamassia and I.
G. Tollis"
, title = "Centipede Graphs
and Visibility on a Cylinder"
, editor = "G. Tinhofer and G.
Schmidt"
, booktitle = "Graph Theoretic Concepts in Computer
Science: Proc. Internat. Workshop WG '86 (Bernierd June 1986)"
, series = "Lecture Notes Comput.
Sci."
, volume = 246
, publisher = "Springer-Verlag"
, address = "Berlin, West Germany"
, year = 1987
, pages = "252--263"
, keywords = "graph drawing"
, update = "96.09 agarwal, 93.09
tamassia"
}
@article{ts-vpiw-91
, author = "S. J. Teller and C.
H. S{\'e}quin"
, title = "Visibility Preprocessing
For Interactive Walkthroughs"
, journal = "Comput. Graph."
, volume = 25
, number = 4
, month = jul
, year = 1991
, pages = "61--69"
, note = "Proc. SIGGRAPH
'91"
, update = "93.09 milone+mitchell"
}
@inproceedings{v-dmvg-91
, author = "G. Vegter"
, title = "Dynamically maintaining
the visibility graph"
, booktitle = "Proc. 2nd Workshop Algorithms Data
Struct."
, series = "Lecture Notes Comput.
Sci."
, volume = 519
, publisher = "Springer-Verlag"
, year = 1991
, pages = "425--436"
, keywords = "visibility, geometric graph"
}
@techreport{w-cvgnl-84
, author = "Emo Welzl"
, title = "Constructing
the visibility graph for $n$ line segments in {$O(n^{2})$} time"
, type = "Technical
{Report}"
, institution = "Inst. Appl. Math. Comput. Sci., Univ. Leiden"
, address = "Leiden, Netherlands"
, year = 1984
, update = "98.03 mitchell, 97.11
bibrelex"
}
@article{w-cvgnl-85
, author = "Emo Welzl"
, title = "Constructing
the visibility graph for $n$ line segments in {$O(n^{2})$} time"
, journal = "Inform. Process. Lett."
, volume = 20
, year = 1985
, pages = "167--171"
, keywords = "motion planning, construction,
detection, visibility, plane-sweep, line segments"
, update = "98.03 mitchell"
}
@article{w-cfvgs-92
, author = "S. Wismath"
, title = "Computing the
full visibility graph of a set of line segments"
, journal = "Inform. Process. Lett."
, volume = 42
, number = 5
, month = jul
, year = 1992
, pages = "257--??"
, update = "98.07 bibrelex"
}
@phdthesis{w-brvgr-89
, author = "S. K. Wismath"
, title = "Bar-Representable
Visibility Graphs and Related Flow Problems"
, type = "Ph.{D.}
Thesis"
, school = "Dept. Comput. Sci.,
Univ. British Columbia"
, year = 1989
, keywords = "graph drawing, visibility, planar"
, update = "97.03 tamassia"
}
@inproceedings{w-cblsg-85
, author = "S. K. Wismath"
, title = "Characterizing
bar line-of-sight graphs"
, booktitle = "Proc. 1st Annu. ACM Sympos. Comput.
Geom."
, year = 1985
, pages = "147--152"
, keywords = "visibility, graph theory, geometric
graphs, graph drawing"
, precedes = "kw-wvgbr-89"
, cites = "-aac-78, et-csn-76,
gjs-agcpc-76, ZZZ"
, update = "97.11 bibrelex, 93.09
milone+mitchell+tamassia"
}