#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1996

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ansgar Grüne, Rolf Klein, C. Miori, S. Segura Gomis
- 2005

Let K ⊂ R be a compact convex set in the plane. A halving chord of K is a line segment pp̂, p, p̂ ∈ ∂K, which divides the area of K into two equal parts. For every direction v there exists exactly one halving chord. Its length hA(v) is the corresponding (area) halving distance. In this article we give inequalities relating the minimum and maximum (area)… (More)

In this paper we summarize the known results and the main tools concerning complete systems of inequalities for families of convex sets. We discuss also the possibility of using these systems to determine particular subfamilies of planar convex sets with specific geometric significance. We also analyze complete systems of inequalities for 3-rotationally… (More)

- M. A. Hernández Cifre, S. Segura Gomis
- Discrete & Computational Geometry
- 2000

- R H de Cabezón, Carlos Sala, S. Segura Gomis, A R Lliso, Cristina Gómez Bellvert
- European journal of obstetrics, gynecology, and…
- 1998

OBJECTIVES
To evaluate the therapeutic and diagnostic potential of large loop excision of the transformation zone (LLETZ) in the management of cervical dysplasia (CD) when colposcopy is satisfactory; to determine if there is a relationship between completeness of excision and outcome.
STUDY DESIGN
Ninety loop diathermies performed in the management of CD… (More)

- S. Segura Gomis
- 1996

We give a generalization of Bender's area-perimeter relation for plane lattice-point-free convex regions to simply connected regions, thus we solve a problem posed by M. Silver 10]. Further the result is used for a lattice version of the Dido problem.

If K is a convex body in the Euclidean space E, we consider the six classic geometric functionals associated with K: its n-dimensional volume V , (n− 1)-dimensional surface area F , diameter d, minimal width ω, circumradius R and inradius r. We prove that the n-spherical symmetric slices are the convex bodies that maximize both, the volume and the surface… (More)

Let E be a subset of a convex, open, bounded, planar set G. Let P (E, G) be the relative perimeter of E (the length of the boundary of E contained in G). We obtain relative geometric inequalities comparing the relative perimeter of E with the relative diameter of E and with its relative inradius. We prove the existence of both extremal sets and maximizers… (More)

- Antonio Cañete, Cinzia Miori, S. Segura Gomis, ANTONIO CAÑETE
- 2014

In this work we study the fencing problem consisting of finding a trisection of a 3-rotationally symmetric planar convex body which minimizes the maximum relative diameter. We prove that an optimal solution is given by the so-called standard trisection. We also determine the optimal set giving the minimum value for this functional and study the… (More)

- ‹
- 1
- ›