#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2010

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends per edge, then the number of edges is at most 6.5n and 74.2n, respectively. This is a strengthening of a… (More)

- Filip Moric, János Pach
- Comput. Geom.
- 2012

Let P be a set of n points in R d. It was conjectured by Schur that the maximum number of (d − 1)-dimensional regular simplices of edge length diam(P), whose every vertex belongs to P , is n. We prove this statement under the condition that any two of the simplices share at least d − 2 vertices and we conjecture that this condition is always satisfied.

- Radoslav Fulek, Filip Moric, David Pritchard
- Discrete Mathematics
- 2011

The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a crucial surgery method, we begin by proving the simpler related upper bounds (4(|V | − 1) − |E|)/3 and 4|V | 2 /3|E| on the… (More)

- Filip Morić, János Pach
- 2012

Given a set P of n points in R d , let d 1 > d 2 >. .. denote all distinct inter-point distances generated by point pairs in P. It was shown by Schur, Martini, Perles, and Kupitz that there is at most one d-dimensional regular simplex of edge length d 1 whose every vertex belongs to P. We extend this result by showing that for any k the number of… (More)

- Filip Moric, David Pritchard
- Electronic Notes in Discrete Mathematics
- 2011

- Filip Moric, János Pach
- Electronic Notes in Discrete Mathematics
- 2013

- Filip Moric, David Pritchard
- ArXiv
- 2011

In a convex n-gon, let d 1 > d 2 > · · · denote the set of all distances between pairs of vertices, and let m i be the number of pairs of vertices at distance d i from one another. Erd˝ os, Lovász, and Vesztergombi conjectured that i≤k m i ≤ kn. Using a new computational approach, we prove their conjecture when k ≤ 4 and n is large; we also make some… (More)

- Filip Moric
- Discrete Mathematics
- 2013

- Zachary Abel, Robert Connelly, +5 authors Csaba D. Tóth
- Symposium on Computational Geometry
- 2014

We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graph H (where H is the "host" of G). The graph G is free in H if for every choice of positive lengths for the edges of G, the host H has a planar straight-line embedding that realizes these lengths; and G is extrinsically free in H if all… (More)

- Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic
- CCCG
- 2010

By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that B ∪ R is in general position, and the convex hull of B contains k interior blue points and l interior red points. Hurtado et al. found sufficient… (More)