FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W157196075> ?p ?o ?g. }

• W157196075 abstract "In this thesis we study a variety of problems in combinatorial and computational geometry, which deal with various aspects of arrangements of geometric objects, in the plane and in higher dimensions. Some of these problems have algorithmic applications, while others provide combinatorial bounds for various structures in such arrangements. The thesis involves two main themes: (i) Counting Crossing Configurations in Geometric Settings and its Applications: Suppose we “draw” a simple undirected graph G = (V, E) in the plane using points to represent vertices, and Jordan arcs connecting them to represent edges. Assume that G has n vertices and m edges and that m ≥ 4n. Then, using a planarity argument, there must exist two crossing arcs in this drawing. This fact can be exploited to show that the number of such crossings is Ω(m/n), no matter how the graph is drawn. The proof of this “Crossing Lemma” is due to Leighton [Lei83] and to Ajtai et al. [ACNS82]. A probabilistic proof of this fact was entitled “A proof from the book” [AZ98]. Adapting and extending the proof technique of the Crossing Lemma, we provide improved asymptotic bounds on well-studied geometric combinatorial problems, such as the “k-set” problem (Chapter 4), the complexity of polytopes spanned by sets of points in the plane and in space (Chapter 3), etc. In Chapter 2 we provide some sharp asymptotic Ramsey type theorems for intersection patterns of “nice” objects that are spanned by finite point sets: For example, we prove that for any dimension d, there exists a constant c = c(d) such that for any set P of n points in IR and any set S of m > cn distinct balls, each bounded by a sphere passing through a distinct pair of points of P , there exists a subset S ′ of S of size at least Ω(m/n) with nonempty intersection. This is asymptotically tight and improves the previously best known bound (see [CEG94]). We extend this result to other families of objects, including pseudo-disks in the plane and axis-parallel boxes in any dimension. The proofs rely on the same probabilistic proof technique of the Crossing Lemma, and can be regarded as extensions of that lemma. The results of this chapter are joint work with Micha Sharir and appear in [SS03b]. In Chapter 3 we prove that the maximum total complexity of k non-overlapping convex polygons in a set of n points in the plane is Θ(n √ k). This bound was already proved in the dual plane by Halperin and Sharir [HS92]. However, our proof is much simpler and uses the Crossing Lemma applied to the collection of edges of the given polygons. Similar results are obtained for more restricted collections of polygons. We then generalize these results to bound the total complexity of k distinct non-overlapping" @default.
• W157196075 created "2016-06-24" @default.
• W157196075 creator A5055296785 @default.
• W157196075 creator A5071731808 @default.
• W157196075 date "2003-01-01" @default.
• W157196075 modified "2023-09-27" @default.
• W157196075 title "Combinatorial Problems in Computational Geometry" @default.
• W157196075 cites W117619795 @default.
• W157196075 cites W118915062 @default.
• W157196075 cites W124550681 @default.
• W157196075 cites W13988344 @default.
• W157196075 cites W147975648 @default.
• W157196075 cites W1517439050 @default.
• W157196075 cites W1586795908 @default.
• W157196075 cites W1597538628 @default.
• W157196075 cites W1642685763 @default.
• W157196075 cites W1723997437 @default.
• W157196075 cites W1973059108 @default.
• W157196075 cites W1974343573 @default.
• W157196075 cites W1979711565 @default.
• W157196075 cites W1980092773 @default.
• W157196075 cites W1984879308 @default.
• W157196075 cites W1986004959 @default.
• W157196075 cites W1987796943 @default.
• W157196075 cites W1989102235 @default.
• W157196075 cites W1991938436 @default.
• W157196075 cites W2006769458 @default.
• W157196075 cites W2012504811 @default.
• W157196075 cites W2018858611 @default.
• W157196075 cites W2021751455 @default.
• W157196075 cites W2022266599 @default.
• W157196075 cites W2024662946 @default.
• W157196075 cites W2028416480 @default.
• W157196075 cites W2028747718 @default.
• W157196075 cites W2048800330 @default.
• W157196075 cites W2049848809 @default.
• W157196075 cites W2050230854 @default.
• W157196075 cites W2054459484 @default.
• W157196075 cites W2058432138 @default.
• W157196075 cites W2058825457 @default.
• W157196075 cites W2068028167 @default.
• W157196075 cites W2068871408 @default.
• W157196075 cites W2078474736 @default.
• W157196075 cites W2081045879 @default.
• W157196075 cites W2093466950 @default.
• W157196075 cites W2094683955 @default.
• W157196075 cites W2101764588 @default.
• W157196075 cites W2111959026 @default.
• W157196075 cites W2112505974 @default.
• W157196075 cites W2115643172 @default.
• W157196075 cites W2120018535 @default.
• W157196075 cites W2120948000 @default.
• W157196075 cites W2139225572 @default.
• W157196075 cites W2147106864 @default.
• W157196075 cites W2149906774 @default.
• W157196075 cites W2153204081 @default.
• W157196075 cites W2163913133 @default.
• W157196075 cites W2166961358 @default.
• W157196075 cites W2167816765 @default.
• W157196075 cites W2169500164 @default.
• W157196075 cites W2573973007 @default.
• W157196075 cites W2775046532 @default.
• W157196075 cites W2912202394 @default.
• W157196075 cites W3147681132 @default.
• W157196075 cites W86126052 @default.
• W157196075 cites W2007506094 @default.
• W157196075 cites W28901126 @default.
• W157196075 hasPublicationYear "2003" @default.
• W157196075 type Work @default.
• W157196075 sameAs 157196075 @default.
• W157196075 citedByCount "33" @default.
• W157196075 countsByYear W1571960752012 @default.
• W157196075 countsByYear W1571960752013 @default.
• W157196075 countsByYear W1571960752014 @default.
• W157196075 countsByYear W1571960752017 @default.
• W157196075 countsByYear W1571960752018 @default.
• W157196075 countsByYear W1571960752019 @default.
• W157196075 countsByYear W1571960752020 @default.
• W157196075 countsByYear W1571960752021 @default.
• W157196075 crossrefType "journal-article" @default.
• W157196075 hasAuthorship W157196075A5055296785 @default.
• W157196075 hasAuthorship W157196075A5071731808 @default.
• W157196075 hasConcept C111472728 @default.
• W157196075 hasConcept C114614502 @default.
• W157196075 hasConcept C118539577 @default.
• W157196075 hasConcept C118615104 @default.
• W157196075 hasConcept C127413603 @default.
• W157196075 hasConcept C138885662 @default.
• W157196075 hasConcept C146978453 @default.
• W157196075 hasConcept C18903297 @default.
• W157196075 hasConcept C2777759810 @default.
• W157196075 hasConcept C2780586882 @default.
• W157196075 hasConcept C33923547 @default.
• W157196075 hasConcept C4107886 @default.
• W157196075 hasConcept C46757340 @default.
• W157196075 hasConcept C64543145 @default.
• W157196075 hasConcept C68260962 @default.
• W157196075 hasConcept C86803240 @default.
• W157196075 hasConceptScore W157196075C111472728 @default.
• W157196075 hasConceptScore W157196075C114614502 @default.

• next