Search Results - "Computer Science - Computational Geometry"

Non-crossing paths with geographic constraints by Silveira, Rodrigo I., Speckmann, Bettina, Verbeek, Kevin

“…A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following…”
Get full text

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem by Hengeveld, Simon, Miltzow, Tillmann

“…Given a closed simple polygon $P$, we say two points $p,q$ see each other if the segment $pq$ is fully contained in $P$. The art gallery problem seeks a…”
Get full text

Planar 3-SAT with a Clause/Variable Cycle by Pilz, Alexander

“…In the Planar 3-SAT problem, we are given a 3-SAT formula together with its incidence graph, which is planar, and are asked whether this formula is…”
Get full text

K_{1,3}$-covering red and blue points in the plane by Ábrego, Bernardo M., Fernández-Merchant, Silvia, Kano, Mikio, Orden, David, Pérez-Lantero, Pablo, Seara, Carlos, Tejel, Javier

“…We say that a finite set of red and blue points in the plane in general position can be $K_{1,3}$-covered if the set can be partitioned into subsets of size…”
Get full text

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs by Di Battista, Giuseppe, Frati, Fabrizio

“…The algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line…”
Get full text

A Note on Flips in Diagonal Rectangulations by Cardinal, Jean, Sacristán, Vera, Silveira, Rodrigo I.

“…Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of…”
Get full text

On polynomials associated to Voronoi diagrams of point sets and crossing numbers by Claverol, Mercè, Heras-Parrilla, Andrea de las, Flores-Peñaloza, David, Huemer, Clemens, Orden, David

“…Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of…”
Get full text

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem by Hengeveld, Simon, Tillmann Miltzow

“…Given a closed simple polygon \(P\), we say two points \(p,q\) see each other if the segment \(pq\) is fully contained in \(P\). The art gallery problem seeks…”
Get full text

On the VC-dimension of half-spaces with respect to convex sets by Grelier, Nicolas, Ilchi, Saeed Gh, Miltzow, Tillmann, Smorodinsky, Shakhar

“…A family S of convex sets in the plane defines a hypergraph H = (S, E) as follows. Every subfamily S' of S defines a hyperedge of H if and only if there exists…”
Get full text

Distinct Angles and Angle Chains in Three Dimensions by Ascoli, Ruben, Betti, Livia, Duke, Jacob Lehmann, Liu, Xuyan, Milgrim, Wyatt, Miller, Steven J., Palsson, Eyvindur A., Acosta, Francisco Romero, Iannuzzelli, Santiago Velazquez

“…In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to find the minimum number of distinct distances between pairs of points selected from any…”
Get full text

A new discrete theory of pseudoconvexity by Keszegh, Balázs

“…Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way…”
Get full text

Ramsey-type theorems for lines in 3-space by Cardinal, Jean, Payne, Michael S., Solomon, Noam

“…We prove geometric Ramsey-type statements on collections of lines in 3-space. These statements give guarantees on the size of a clique or an independent set in…”
Get full text

The Flip Diameter of Rectangulations and Convex Subdivisions by Ackerman, Eyal, Allen, Michelle M., Barequet, Gill, Löffler, Maarten, Mermelstein, Joshua, Souvaine, Diane L., Tóth, Csaba D.

“…We study the configuration space of rectangulations and convex subdivisions of $n$ points in the plane. It is shown that a sequence of $O(n\log n)$ elementary…”
Get full text

Gathering on a circle with limited visibility by anonymous oblivious robots by Giuseppe A. Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi

Get full text

Finite choice, convex choice and finding roots by Roux, Stéphane Le, Pauly, Arno

“…We investigate choice principles in the Weihrauch lattice for finite sets on the one hand, and convex sets on the other hand. Increasing cardinality and…”
Get full text

Stabbing boxes with finitely many axis-parallel lines and flats by Chakraborty, Sutanoya, Ghosh, Arijit, Nandi, Soumi

“…In this short note, we provide the necessary and sufficient condition for an infinite collection of axis-parallel boxes in \(\mathbb{R}^{d}\) to be pierceable…”
Get full text

Modeling and hexahedral meshing of cerebral arterial networks from centerlines by Méghane Decroocq, Carole Frindel, Pierre Rougé, Makoto Ohta, Guillaume Lavoué

Get full text

Machining Feature Recognition Using Descriptors with Range Constraints for Mechanical 3D Models by Seungeun Lim, Changmo Yeo, Fazhi He, Jinwon Lee, Duhwan Mun

Get full text

Online Class Cover Problem by De, Minati, Maheshwari, Anil, Mandal, Ratnadip

“…In this paper, we study the online class cover problem where a (finite or infinite) family \(\cal F\) of geometric objects and a set \({\cal P}_r\) of red…”
Get full text

Surface Patches with Rounded Corners by Marussig, Benjamin, Reif, Ulrich

“…We analyze surface patches with a corner that is rounded in the sense that the partial derivatives at that point are antiparallel. Sufficient conditions for…”
Get full text