13,051 research outputs found
Optimal Filling of Shapes
We present filling as a type of spatial subdivision problem similar to
covering and packing. Filling addresses the optimal placement of overlapping
objects lying entirely inside an arbitrary shape so as to cover the most
interior volume. In n-dimensional space, if the objects are polydisperse
n-balls, we show that solutions correspond to sets of maximal n-balls. For
polygons, we provide a heuristic for finding solutions of maximal discs. We
consider the properties of ideal distributions of N discs as N approaches
infinity. We note an analogy with energy landscapes.Comment: 5 page
Semi-Automated SVG Programming via Direct Manipulation
Direct manipulation interfaces provide intuitive and interactive features to
a broad range of users, but they often exhibit two limitations: the built-in
features cannot possibly cover all use cases, and the internal representation
of the content is not readily exposed. We believe that if direct manipulation
interfaces were to (a) use general-purpose programs as the representation
format, and (b) expose those programs to the user, then experts could customize
these systems in powerful new ways and non-experts could enjoy some of the
benefits of programmable systems.
In recent work, we presented a prototype SVG editor called Sketch-n-Sketch
that offered a step towards this vision. In that system, the user wrote a
program in a general-purpose lambda-calculus to generate a graphic design and
could then directly manipulate the output to indirectly change design
parameters (i.e. constant literals) in the program in real-time during the
manipulation. Unfortunately, the burden of programming the desired
relationships rested entirely on the user.
In this paper, we design and implement new features for Sketch-n-Sketch that
assist in the programming process itself. Like typical direct manipulation
systems, our extended Sketch-n-Sketch now provides GUI-based tools for drawing
shapes, relating shapes to each other, and grouping shapes together. Unlike
typical systems, however, each tool carries out the user's intention by
transforming their general-purpose program. This novel, semi-automated
programming workflow allows the user to rapidly create high-level, reusable
abstractions in the program while at the same time retaining direct
manipulation capabilities. In future work, our approach may be extended with
more graphic design features or realized for other application domains.Comment: In 29th ACM User Interface Software and Technology Symposium (UIST
2016
Large induced subgraphs via triangulations and CMSO
We obtain an algorithmic meta-theorem for the following optimization problem.
Let \phi\ be a Counting Monadic Second Order Logic (CMSO) formula and t be an
integer. For a given graph G, the task is to maximize |X| subject to the
following: there is a set of vertices F of G, containing X, such that the
subgraph G[F] induced by F is of treewidth at most t, and structure (G[F],X)
models \phi.
Some special cases of this optimization problem are the following generic
examples. Each of these cases contains various problems as a special subcase:
1) "Maximum induced subgraph with at most l copies of cycles of length 0
modulo m", where for fixed nonnegative integers m and l, the task is to find a
maximum induced subgraph of a given graph with at most l vertex-disjoint cycles
of length 0 modulo m.
2) "Minimum \Gamma-deletion", where for a fixed finite set of graphs \Gamma\
containing a planar graph, the task is to find a maximum induced subgraph of a
given graph containing no graph from \Gamma\ as a minor.
3) "Independent \Pi-packing", where for a fixed finite set of connected
graphs \Pi, the task is to find an induced subgraph G[F] of a given graph G
with the maximum number of connected components, such that each connected
component of G[F] is isomorphic to some graph from \Pi.
We give an algorithm solving the optimization problem on an n-vertex graph G
in time O(#pmc n^{t+4} f(t,\phi)), where #pmc is the number of all potential
maximal cliques in G and f is a function depending of t and \phi\ only. We also
show how a similar running time can be obtained for the weighted version of the
problem. Pipelined with known bounds on the number of potential maximal
cliques, we deduce that our optimization problem can be solved in time
O(1.7347^n) for arbitrary graphs, and in polynomial time for graph classes with
polynomial number of minimal separators
Importing Vector Graphics: The grImport Package for R
This article describes an approach to importing vector-based graphical images into statistical software as implemented in a package called grImport for the R statistical computing environment. This approach assumes that an original image can be transformed into a PostScript format (i.e., the original image is in a standard vector graphics format such as PostScript, PDF, or SVG). The grImport package consists of three components: a function for converting PostScript files to an R-specific XML format; a function for reading the XML format into special Picture objects in R; and functions for manipulating and drawing Picture objects. Several examples and applications are presented, including annotating a statistical plot with an imported logo and using imported images as plotting symbols.
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
We explore an instance of the question of partitioning a polygon into pieces,
each of which is as ``circular'' as possible, in the sense of having an aspect
ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters
of the smallest circumscribing circle to the largest inscribed disk. The
problem is rich even for partitioning regular polygons into convex pieces, the
focus of this paper. We show that the optimal (most circular) partition for an
equilateral triangle has an infinite number of pieces, with the lower bound
approachable to any accuracy desired by a particular finite partition. For
pentagons and all regular k-gons, k > 5, the unpartitioned polygon is already
optimal. The square presents an interesting intermediate case. Here the
one-piece partition is not optimal, but nor is the trivial lower bound
approachable. We narrow the optimal ratio to an aspect-ratio gap of 0.01082
with several somewhat intricate partitions.Comment: 21 pages, 25 figure
Solving Irregular Strip Packing Problems With Free Rotations Using Separation Lines
Solving nesting problems or irregular strip packing problems is to position
polygons in a fixed width and unlimited length strip, obeying polygon integrity
containment constraints and non-overlapping constraints, in order to minimize
the used length of the strip. To ensure non-overlapping, we used separation
lines. A straight line is a separation line if given two polygons, all vertices
of one of the polygons are on one side of the line or on the line, and all
vertices of the other polygon are on the other side of the line or on the line.
Since we are considering free rotations of the polygons and separation lines,
the mathematical model of the studied problem is nonlinear. Therefore, we use
the nonlinear programming solver IPOPT (an algorithm of interior points type),
which is part of COIN-OR. Computational tests were run using established
benchmark instances and the results were compared with the ones obtained with
other methodologies in the literature that use free rotation
- …