Výsledky vyhledávání - "Hazel Everett"

Autor: Hazel Everett, Stephen K. Wismath, Prosenjit Bose

Publikováno v: International Journal of Computational Geometry & Applications. 13:447-462

An arrangement graph G is the abstract graph obtained from an arrangement of lines L, in general position by associating vertices of G with the intersection points of L, and the edges of G with the line segments joining the intersection points of L.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c3558b1a2c7cf1f0d0cf5e2f1251f9ac
https://doi.org/10.1142/s0218195903001281

Zobrazit plný text záznamu

The Expected Number of 3D Visibility Events Is Linear

Autor: Xavier Goaoc, Sylvain Petitjean, Vida Dujmović, Hazel Everett, Hyeon-Suk Na, Sylvain Lazard, Olivier Devillers

Publikováno v: SIAM Journal on Computing
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2003, 32 (6), pp.1586-1620. ⟨10.1137/S0097539702419662⟩
SIAM Journal on Computing, 2003, 32 (6), pp.1586-1620. ⟨10.1137/S0097539702419662⟩

In this paper, we show that, amongst $n$ uniformly distributed unit balls in $\mathbb{R}^3$, the expected number of maximal nonoccluded line segments tangent to four balls is linear. Using our techniques we show a linear bound on the expected size of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5e974c4564230d0e3143c9511536a6a
https://doi.org/10.1137/s0097539702419662

Zobrazit plný text záznamu

Stabbing information of a simple polygon

Autor: Ferran Hurtado, Hazel Everett, Marc Noy

Publikováno v: Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 1999, 91 (1-3), pp.67-92
Discrete Applied Mathematics, 1999, 91 (1-3), pp.67-92

Article dans revue scientifique avec comité de lecture.; The purpose of this paper is to investigate a new combinatorial object describing the structure of a simple polygon and compare it to other well-known objects such as the internal and external

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb95bb6ad030a84eb0391e53e9630369
https://doi.org/10.1016/s0166-218x(98)00144-9

Zobrazit plný text záznamu

The homogeneous set sandwich problem

Autor: Hazel Everett, Celina M. H. de Figueiredo, Márcia R. Cerioli, Sulamita Klein

Publikováno v: Information Processing Letters. 67:31-35

The graph sandwich problem for property Φ is defined as follows: Given two graphs G 1 = ( V , E 1 ) and G 2 = ( V , E 2 ) such that E 1 ⊆ E 2 , is there a graph G = ( V , E ) such that E 1 ⊆ E ⊆ E 2 which satisfies property Φ? We present a po

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::34352b030cd33926696caa27cb0f01ee
https://doi.org/10.1016/s0020-0190(98)00076-3

Zobrazit plný text záznamu

A Visibility Representation for Graphs in Three Dimensions

Autor: Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle

Publikováno v: Journal of Graph Algorithms and Applications. 2:1-16

This paper proposes a 3-dimensional visibility representation of graphs G =( V;E) in which vertices are mapped to rectangles floating in R 3 parallel to the x;y-plane, with edges represented by vertical lines of sight. We apply an extension of the Er

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7829032d337906b0cae16491f7d56dbb
https://doi.org/10.7155/jgaa.00006

Zobrazit plný text záznamu

Separating Translates in the Plane: Combinatorial Bounds and an Algorithm

Autor: Jean-Marc Robert, Hazel Everett, Jurek Czyzowicz

Publikováno v: International Journal of Computational Geometry & Applications. :551-562

Given a family of pairwise disjoint convex sets S in the plane, a set [Formula: see text] is separated from a subset X ⊆ S if there exists a line l such that [Formula: see text] lies on one side of l and the sets in X lie on the other side. In this

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ce786dacf31032613fe94f3d99b71fef
https://doi.org/10.1142/s021819599700034x

Zobrazit plný text záznamu

Path parity and perfection

Autor: Celina M. H. de Figueiredo, Hazel Everett, Oscar Porto, Bruce A. Reed, Cláudia Linhares-Sales, Frédéric Maffray

Publikováno v: Scopus-Elsevier

Two nonadjacent vertices x and y in a graph G form an even pair if every induced path between them has an even number of edges. For a given pair {x, y} in a graph G, we denote by Gxy the graph obtained from G by contracting x and y. In 1982, Fonlupt

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39832f9637a66737dc1b6df6d0b61637

Zobrazit plný text záznamu

AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS

Autor: Jean-Marc Robert, Marc van Kreveld, Hazel Everett

Publikováno v: International Journal of Computational Geometry & Applications. :247-261

This paper gives an optimal O(n log n+nk) time algorithm for constructing the levels 1,…, k in an arrangement of n lines in the plane. This algorithm is extended to compute these levels in an arrangement of n unbounded x-monotone polygonal convex c

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::87a9f187c11ec1695c65141e9f648e2f
https://doi.org/10.1142/s0218195996000186

Zobrazit plný text záznamu

Negative results on characterizing visibility graphs

Autor: Derek G. Corneil, Hazel Everett

Publikováno v: Computational Geometry. 5:51-63

There is no known combinatorial characterization of the visibility graphs of simple polygons. In this paper we show negative results on two different approaches to finding such a characterization. We show that Ghosh's three necessary conditions for a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a0b1e46b8f47c3ca97a6d5ef9ae3385d
https://doi.org/10.1016/0925-7721(95)00021-z

Zobrazit plný text záznamu

TRANSLATION QUERIES FOR SETS OF POLYGONS

Autor: Hazel Everett, Hubert Wagener, de Mt Mark Berg

Publikováno v: International Journal of Computational Geometry & Applications. :221-242

Let S be a set of m polygons in the plane with a total of n vertices. A translation order for S in direction [Formula: see text] is an order on the polygons such that no collisions occur if the polygons are moved one by one to infinity in direction [

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::abdda0d641ed952131f055a51a7ba86c
https://doi.org/10.1142/s0218195995000131

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání