当前期刊: Computational Geometry Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • On the minimum-area rectangular and square annulus problem
    Comput. Geom. (IF 0.476) Pub Date : 2020-07-29
    Sang Won Bae

    In this paper, we address the minimum-area rectangular and square annulus problem, which asks a rectangular or square annulus of minimum area, either in a fixed orientation or over all orientations, that encloses a set P of n input points in the plane. To our best knowledge, no nontrivial results on the problem have been discussed in the literature, while its minimum-width variants have been intensively

    更新日期:2020-08-03
  • Tilings of the regular N-gon with triangles of angles π/N,π/N,(N − 2)π/N for N = 5,8,10 and 12
    Comput. Geom. (IF 0.476) Pub Date : 2020-07-21
    M. Laczkovich

    We say that a triangle T tiles a polygon A, if A can be dissected into finitely many nonoverlapping triangles similar to T. We are concerned with the question whether the triangle of angles π/N,π/N, (N−2)π/N tiles the regular N-gon. It is easy to see that if N=3,4 or 6, then the answer is affirmative. We show the same in the cases N=5,8,10 and 12.

    更新日期:2020-07-29
  • Soft subdivision motion planning for complex planar robots
    Comput. Geom. (IF 0.476) Pub Date : 2020-07-15
    Bo Zhou; Yi-Jen Chiang; Chee Yap

    The design and implementation of theoretically-sound robot motion planning algorithms is challenging. Within the framework of resolution-exact algorithms, it is possible to exploit soft predicates for collision detection. The design of soft predicates is a balancing act between their implementability and their accuracy/effectivity. In this paper, we focus on the class of planar polygonal rigid robots

    更新日期:2020-07-27
  • I/O-efficient 2-d orthogonal range skyline and attrition priority queues
    Comput. Geom. (IF 0.476) Pub Date : 2020-07-24
    Casper Kejlberg-Rasmussen; Yufei Tao; Konstantinos Tsakalidis; Kostas Tsichlas; Jeonghun Yoon

    We present the first static and dynamic external memory data structures for variants of 2-d orthogonal range skyline reporting with worst-case logarithmic query and update I/O-complexity. The results are obtained by using persistent data structures and by extending the attrition priorities queues of Sundar [IPL 1989] to also support real-time concatenation, a result of independent interest. We show

    更新日期:2020-07-24
  • Rectilinear link diameter and radius in a rectilinear polygonal domain
    Comput. Geom. (IF 0.476) Pub Date : 2020-07-11
    Elena Arseneva; Man-Kwun Chiu; Matias Korman; Aleksandar Markovic; Yoshio Okamoto; Aurélien Ooms; André van Renssen; Marcel Roeloffzen

    We study the computation of the diameter and radius under the rectilinear link distance within a rectilinear polygonal domain of n vertices and h holes. We introduce a graph of oriented distances to encode the distance between pairs of points of the domain. This helps us transform the problem so that we can search through the candidates more efficiently. Our algorithm computes both the diameter and

    更新日期:2020-07-20
  • Smallest universal covers for families of triangles
    Comput. Geom. (IF 0.476) Pub Date : 2020-07-09
    Ji-won Park; Otfried Cheong

    A universal cover for a family T of triangles is a convex set that contains a congruent copy of each triangle T∈T. We conjecture that for any family T of triangles of bounded diameter there is a triangle that forms a universal cover for T of smallest possible area. We prove this conjecture for all families of two triangles, and for the family of triangles that fit in the unit disk.

    更新日期:2020-07-17
  • On pseudo-disk hypergraphs
    Comput. Geom. (IF 0.476) Pub Date : 2020-07-09
    Boris Aronov; Anirudh Donakonda; Esther Ezra; Rom Pinchasi

    Let F be a family of pseudo-disks in the plane, and P be a finite subset of F. Consider the hyper-graph H(P,F) whose vertices are the pseudo-disks in P and the edges are all subsets of P of the form {D∈P|D∩S≠∅}, where S is a pseudo-disk in F. We give an upper bound of O(nk3) for the number of edges in H(P,F) of cardinality at most k. This generalizes a result of Buzaglo et al. [4]. As an application

    更新日期:2020-07-15
  • Improved PTASs for convex barrier coverage
    Comput. Geom. (IF 0.476) Pub Date : 2020-07-09
    Paz Carmi; Matthew J. Katz; Rachel Saban; Yael Stein

    Let R be a connected and closed region in the plane and let S be a set of n points (representing mobile sensors) in the interior of R. We think of R's boundary as a barrier which needs to be monitored. This gives rise to the barrier coverage problem, where one needs to move the sensors to the boundary of R, so that every point on the boundary is covered by one of the sensors. We focus on the variant

    更新日期:2020-07-15
  • Two theorems on point-flat incidences
    Comput. Geom. (IF 0.476) Pub Date : 2020-06-26
    Ben Lund

    We improve the theorem of Beck giving a lower bound on the number of k-flats spanned by a set of points in real space, and improve the bound of Elekes and Tóth on the number of incidences between points and k-flats in real space.

    更新日期:2020-07-13
  • An improved construction for spanners of disks
    Comput. Geom. (IF 0.476) Pub Date : 2020-07-01
    Michiel Smid

    Let D be a set of n pairwise disjoint disks in the plane. Consider the metric space in which the distance between any two disks D and D′ in D is the length of the shortest line segment that connects D and D′. For any real number ε>0, we show how to obtain a (1+ε)-spanner for this metric space that has at most (2π/ε)⋅n edges. The previously best known result is by Bose et al. (2011) [1]. Their (1+ε)-spanner

    更新日期:2020-07-07
  • Covering the plane by a sequence of circular disks with a constraint
    Comput. Geom. (IF 0.476) Pub Date : 2020-06-15
    Amitava Bhattacharya; Anupam Mondal

    We are interested in the following problem of covering the plane by a sequence of congruent circular disks with a constraint on the distance between consecutive disks. Let (Dn)n∈N be a sequence of closed unit circular disks such that ∪n∈NDn=R2 with the condition that for n≥2, the center of the disk Dn lies in Dn−1. What is a “most economical” or an optimal way of placing Dn for all n∈N? We answer this

    更新日期:2020-06-15
  • Range closest-pair search in higher dimensions
    Comput. Geom. (IF 0.476) Pub Date : 2020-06-05
    Timothy M. Chan; Saladi Rahul; Jie Xue

    Range closest-pair (RCP) search is a range-search variant of the classical closest-pair problem, which aims to store a given set S of points into some space-efficient data structure such that when a query range Q is specified, the closest pair in S∩Q can be reported quickly. RCP search has received attention over years, but the primary focus was only on R2. In this paper, we study RCP search in higher

    更新日期:2020-06-05
  • Two disjoint 5-holes in point sets
    Comput. Geom. (IF 0.476) Pub Date : 2020-06-02
    Manfred Scheucher

    Given a set of points S⊆R2, a subset X⊆S with |X|=k is called k-gon if all points of X lie on the boundary of the convex hull of X, and k-hole if, in addition, no point of S∖X lies in the convex hull of X. We use computer assistance to show that every set of 17 points in general position admits two disjoint 5-holes, that is, holes with disjoint respective convex hulls. This answers a question of Hosono

    更新日期:2020-06-02
  • Combinatorics of beacon-based routing in three dimensions
    Comput. Geom. (IF 0.476) Pub Date : 2020-05-28
    Jonas Cleve; Wolfgang Mulzer

    A beacon b∈Rd is a point-shaped object in d-dimensional space that can exert a magnetic pull on any other point-shaped object p∈Rd. This object p then moves greedily towards b. The motion stops when p gets stuck at an obstacle or when p reaches b. By placing beacons inside a d-dimensional polyhedron P, we can implement a scheme to route point-shaped objects between any two locations in P. We can also

    更新日期:2020-05-28
  • Output sensitive algorithms for approximate incidences and their applications
    Comput. Geom. (IF 0.476) Pub Date : 2020-05-22
    Dror Aiger; Haim Kaplan; Micha Sharir

    An ε-approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most ε from each other. Given a set of points and a set of objects, computing the approximate incidences between them is a major step in many database and web-based applications in computer vision and graphics, including robust model fitting, approximate

    更新日期:2020-05-22
  • Extending upward planar graph drawings
    Comput. Geom. (IF 0.476) Pub Date : 2020-05-22
    Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati

    In this paper we study the computational complexity of the Upward Planarity Extension problem, which takes as input an upward planar drawing ΓH of a subgraph H of a directed graph G and asks whether ΓH can be extended to an upward planar drawing of G. Our study fits into the line of research on the extensibility of partial representations, which has recently become a mainstream in Graph Drawing. We

    更新日期:2020-05-22
  • Dihedral Deformation and Rigidity
    Comput. Geom. (IF 0.476) Pub Date : 2020-05-12
    Nina Amenta; Carlos Rojas

    We consider defining the embedding of a triangle mesh into R3, up to translation, rotation, and scale, by its vector of dihedral angles. On the theoretical side, we show that locally the map from realizable vectors of dihedrals to mesh embeddings is one-to-one almost everywhere. On the implementation side, we are interested in using the dihedral parameterization in shape analysis. This demands a way

    更新日期:2020-05-12
  • Packing plane spanning trees into a point set
    Comput. Geom. (IF 0.476) Pub Date : 2020-05-05
    Ahmad Biniaz; Alfredo García

    Let P be a set of n points in the plane in general position. We show that at least ⌊n/3⌋ plane spanning trees can be packed into the complete geometric graph on P. This improves the previous best known lower bound Ω(n). Towards our proof of this lower bound we show that the center of a set of points, in the d-dimensional space in general position, is of dimension either 0 or d.

    更新日期:2020-05-05
  • Trajectory planning for an articulated probe
    Comput. Geom. (IF 0.476) Pub Date : 2020-04-28
    Ka Yaw Teo; Ovidiu Daescu; Kyle Fox

    We consider a new trajectory planning problem involving a simple articulated probe. The probe is modeled as two line segments ab and bc, with a joint at the common point b, where bc is of fixed length r and ab is of arbitrarily large length. Initially, ab and bc are collinear. Given a set of obstacles in the form of n line segments and a target point t, the probe is to first be inserted in straight

    更新日期:2020-04-28
  • Reconstructing embedded graphs from persistence diagrams
    Comput. Geom. (IF 0.476) Pub Date : 2020-04-27
    Robin Lynne Belton; Brittany Terese Fasy; Rostik Mertz; Samuel Micka; David L. Millman; Daniel Salinas; Anna Schenfisch; Jordan Schupbach; Lucia Williams

    The persistence diagram (PD) is an increasingly popular topological descriptor. By encoding the size and prominence of topological features at varying scales, the PD provides important geometric and topological information about a space. Recent work has shown that well-chosen (finite) sets of PDs can differentiate between geometric simplicial complexes, providing a method for representing complex shapes

    更新日期:2020-04-27
  • Finding minimum witness sets in orthogonal polygons
    Comput. Geom. (IF 0.476) Pub Date : 2020-04-27
    I. Aldana-Galván; C. Alegría; J.L. Álvarez-Rebollar; N. Marín; E. Solís-Villarreal; J. Urrutia; C. Velarde

    A witness set W in a polygon P is a subset of P such that any set G⊂P that guards W is guaranteed to guard P. We study the problem of finding a minimum witness set for an orthogonal polygon under three models of orthogonal visibility. It is known that not all simple polygons admit a finite witness set under the traditional line-segment visibility and, if a polygon admits a finite minimal witness set

    更新日期:2020-04-27
  • Approximate range closest-pair queries
    Comput. Geom. (IF 0.476) Pub Date : 2020-04-24
    Jie Xue; Yuan Li; Ravi Janardan

    The range closest-pair (RCP) problem, as a range-search version of the classical closest-pair problem, aims to store a dataset of points in some data structure such that whenever a query range Q is given, the closest-pair inside Q can be reported efficiently. In this paper, we study the approximate version of the RCP problem with two approximation criteria. The first criterion is in terms of the query

    更新日期:2020-04-24
  • Parallel computation of alpha complexes for biomolecules
    Comput. Geom. (IF 0.476) Pub Date : 2020-04-14
    Talha Bin Masood; Tathagata Ray; Vijay Natarajan

    The alpha complex, a subset of the Delaunay triangulation, has been extensively used as the underlying representation for biomolecular structures. We propose a GPU-based parallel algorithm for the computation of the alpha complex, which exploits the knowledge of typical spatial distribution and sizes of atoms in a biomolecule. Unlike existing methods, this algorithm does not require prior construction

    更新日期:2020-04-14
  • Improved approximation bounds for the minimum constraint removal problem
    Comput. Geom. (IF 0.476) Pub Date : 2020-04-02
    Sayan Bandyapadhyay; Neeraj Kumar; Subhash Suri; Kasturi Varadarajan

    In the minimum constraint removal problem, we are given a set of overlapping geometric objects as obstacles in the plane, and we want to find the minimum number of obstacles that must be removed to reach a target point t from the source point s by an obstacle-free path. The problem is known to be intractable and no sub-linear approximations are known even for simple obstacles such as rectangles and

    更新日期:2020-04-02
  • Extending Erdős–Beck's theorem to higher dimensions
    Comput. Geom. (IF 0.476) Pub Date : 2020-04-01
    Thao Do

    Erdős-Beck's theorem states that n points in the plane with at most n−x points collinear define at least cxn lines for some positive constant c. It implies n points in the plane define Θ(n2) lines unless most of the points (i.e. n−o(n) points) are collinear. In this paper, we will present two ways to extend this result to higher dimensions. Given a set S of n points in Rd, we want to estimate a lower

    更新日期:2020-04-01
  • An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets
    Comput. Geom. (IF 0.476) Pub Date : 2020-03-16
    Imre Bárány; Nabil H. Mustafa

    We show that, as a consequence of a new result of Pór on universal Tverberg partitions, any large-enough set P of points in Rd has a (d+2)-sized subset whose Radon point has half-space depth at least cd⋅|P|, where cd∈(0,1) depends only on d. We then give two applications of this result. The first is to computing weak ϵ-nets by random sampling. The second is to show that given any set P of points in

    更新日期:2020-03-16
  • Symmetric assembly puzzles are hard, beyond a few pieces
    Comput. Geom. (IF 0.476) Pub Date : 2020-03-09
    Erik D. Demaine; Matias Korman; Jason S. Ku; Joseph S.B. Mitchell; Yota Otachi; André van Renssen; Marcel Roeloffzen; Ryuhei Uehara; Yushi Uno

    We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the problem is strongly NP-complete even if the pieces are all polyominos. On the positive side, we show that the problem can be solved in polynomial time if the number

    更新日期:2020-03-09
  • Gathering by repulsion
    Comput. Geom. (IF 0.476) Pub Date : 2020-03-02
    Prosenjit Bose; Thomas C. Shermer

    We consider a repulsion actuator located in an n-sided convex environment full of point particles. When the actuator is activated, all the particles move away from the actuator. We study the problem of gathering all the particles to a point. We give an O(n2) time algorithm to compute all the actuator locations that gather the particles to one point with one activation, and an O(n) time algorithm to

    更新日期:2020-03-02
  • 1-bend upward planar slope number of SP-digraphs
    Comput. Geom. (IF 0.476) Pub Date : 2020-02-26
    Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani

    It is proved that every series-parallel digraph whose maximum vertex degree is Δ admits an upward planar drawing with at most one bend per edge such that each edge segment has one of Δ distinct slopes. The construction is worst-case optimal in terms of the number of slopes, and it gives rise to drawings with optimal angular resolution πΔ. A variant of the drawing algorithm is used to show that (non-directed)

    更新日期:2020-02-26
  • Weighted straight skeletons in the plane.
    Comput. Geom. (IF 0.476) Pub Date : 2015-02-05
    Therese Biedl,Martin Held,Stefan Huber,Dominik Kaaser,Peter Palfrader

    We investigate weighted straight skeletons from a geometric, graph-theoretical, and combinatorial point of view. We start with a thorough definition and shed light on some ambiguity issues in the procedural definition. We investigate the geometry, combinatorics, and topology of faces and the roof model, and we discuss in which cases a weighted straight skeleton is connected. Finally, we show that the

    更新日期:2019-11-01
  • An Almost Linear Time Algorithm for Field Splitting in Radiation Therapy.
    Comput. Geom. (IF 0.476) Pub Date : 2014-07-08
    Xiaodong Wu,Xin Dou,John E Bayouth,John M Buatti

    In this paper, we study an interesting geometric partition problem, called optimal field splitting, which arises in Intensity-Modulated Radiation Therapy (IMRT). In current clinical practice, a multi-leaf collimator (MLC) with a maximum leaf spread constraint is used to deliver the prescribed intensity maps (IMs). However, the maximum leaf spread of an MLC may require to split a large intensity map

    更新日期:2019-11-01
  • Extreme point and halving edge search in abstract order types.
    Comput. Geom. (IF 0.476) Pub Date : 2013-10-05
    Oswin Aichholzer,Tillmann Miltzow,Alexander Pilz

    Many properties of finite point sets only depend on the relative position of the points, e.g., on the order type of the set. However, many fundamental algorithms in computational geometry rely on coordinate representations. This includes the straightforward algorithms for finding a halving line for a given planar point set, as well as finding a point on the convex hull, both in linear time. In his

    更新日期:2019-11-01
  • Blocking Delaunay triangulations.
    Comput. Geom. (IF 0.476) Pub Date : 2013-03-14
    Oswin Aichholzer,Ruy Fabila-Monroy,Thomas Hackl,Marc van Kreveld,Alexander Pilz,Pedro Ramos,Birgit Vogtenhuber

    Given a set B of n black points in general position, we say that a set of white points W blocks B if in the Delaunay triangulation of [Formula: see text] there is no edge connecting two black points. We give the following bounds for the size of the smallest set W blocking B: (i) [Formula: see text] white points are always sufficient to block a set of n black points, (ii) if B is in convex position

    更新日期:2019-11-01
  • Pointed drawings of planar graphs.
    Comput. Geom. (IF 0.476) Pub Date : 2013-03-09
    Oswin Aichholzer,Günter Rote,André Schulz,Birgit Vogtenhuber

    We study the problem how to draw a planar graph crossing-free such that every vertex is incident to an angle greater than π. In general a plane straight-line drawing cannot guarantee this property. We present algorithms which construct such drawings with either tangent-continuous biarcs or quadratic Bézier curves (parabolic arcs), even if the positions of the vertices are predefined by a given plane

    更新日期:2019-11-01
  • A package for exact kinetic data structures and sweepline algorithms.
    Comput. Geom. (IF 0.476) Pub Date : 2007-09-01
    Daniel Russel,Menelaos I Karavelas,Leonidas J Guibas

    In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was influenced by various considerations, including extensibility, support for multiple kinetic data structures, access to existing data structures and algorithms in CGAL, as well as debugging. Due to the similarity between the

    更新日期:2019-11-01
  • Deformable spanners and applications.
    Comput. Geom. (IF 0.476) Pub Date : 2006-08-01
    Jie Gao,Leonidas J Guibas,An Nguyen

    For a set S of points in ℝ(d), an s-spanner is a subgraph of the complete graph with node set S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidean distance between the points. In this paper we propose a new sparse (1 + ε)-spanner with O(n/ε(d)) edges, where ε is a specified parameter. The key property of this spanner is that it

    更新日期:2019-11-01
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
欢迎访问IOP中国网站
GIANT
产业、创新与基础设施
自然科研线上培训服务
材料学研究精选
胸腔和胸部成像专题
屿渡论文,编辑服务
何川
苏昭铭
陈刚
姜涛
李闯创
李刚
北大
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
上海纽约大学
张健
毛峥伟
陈芬儿
厦门大学
李祥
江浪
张昊
杨中悦
试剂库存
天合科研
down
wechat
bug