376 research outputs found
Pushing the Limits of 3D Color Printing: Error Diffusion with Translucent Materials
Accurate color reproduction is important in many applications of 3D printing,
from design prototypes to 3D color copies or portraits. Although full color is
available via other technologies, multi-jet printers have greater potential for
graphical 3D printing, in terms of reproducing complex appearance properties.
However, to date these printers cannot produce full color, and doing so poses
substantial technical challenges, from the shear amount of data to the
translucency of the available color materials. In this paper, we propose an
error diffusion halftoning approach to achieve full color with multi-jet
printers, which operates on multiple isosurfaces or layers within the object.
We propose a novel traversal algorithm for voxel surfaces, which allows the
transfer of existing error diffusion algorithms from 2D printing. The resulting
prints faithfully reproduce colors, color gradients and fine-scale details.Comment: 15 pages, 14 figures; includes supplemental figure
A Little Statistical Mechanics for the Graph Theorist
In this survey, we give a friendly introduction from a graph theory
perspective to the q-state Potts model, an important statistical mechanics tool
for analyzing complex systems in which nearest neighbor interactions determine
the aggregate behavior of the system. We present the surprising equivalence of
the Potts model partition function and one of the most renowned graph
invariants, the Tutte polynomial, a relationship that has resulted in a
remarkable synergy between the two fields of study. We highlight some of these
interconnections, such as computational complexity results that have alternated
between the two fields. The Potts model captures the effect of temperature on
the system and plays an important role in the study of thermodynamic phase
transitions. We discuss the equivalence of the chromatic polynomial and the
zero-temperature antiferromagnetic partition function, and how this has led to
the study of the complex zeros of these functions. We also briefly describe
Monte Carlo simulations commonly used for Potts model analysis of complex
systems. The Potts model has applications as widely varied as magnetism, tumor
migration, foam behaviors, and social demographics, and we provide a sampling
of these that also demonstrates some variations of the Potts model. We conclude
with some current areas of investigation that emphasize graph theoretic
approaches.
This paper is an elementary general audience survey, intended to popularize
the area and provide an accessible first point of entry for further
exploration.Comment: 30 pages, 3 figure
Avian Cone Photoreceptors Tile the Retina as Five Independent, Self-Organizing Mosaics
The avian retina possesses one of the most sophisticated cone photoreceptor systems among vertebrates. Birds have five types of cones including four single cones, which support tetrachromatic color vision and a double cone, which is thought to mediate achromatic motion perception. Despite this richness, very little is known about the spatial organization of avian cones and its adaptive significance. Here we show that the five cone types of the chicken independently tile the retina as highly ordered mosaics with a characteristic spacing between cones of the same type. Measures of topological order indicate that double cones are more highly ordered than single cones, possibly reflecting their posited role in motion detection. Although cones show spacing interactions that are cell type-specific, all cone types use the same density-dependent yardstick to measure intercone distance. We propose a simple developmental model that can account for these observations. We also show that a single parameter, the global regularity index, defines the regularity of all five cone mosaics. Lastly, we demonstrate similar cone distributions in three additional avian species, suggesting that these patterning principles are universal among birds. Since regular photoreceptor spacing is critical for uniform sampling of visual space, the cone mosaics of the avian retina represent an elegant example of the emergence of adaptive global patterning secondary to simple local interactions between individual photoreceptors. Our results indicate that the evolutionary pressures that gave rise to the avian retina's various adaptations for enhanced color discrimination also acted to fine-tune its spatial sampling of color and luminance
Algorithms for weighted coloring problems
In this thesis, we studied a generalization of vertex coloring problem (VCP). A classical VCP is an assignment of colors to the vertices of a given graph such that no two adjacent vertices receive the same color. The objective is to find a coloring with the minimum number of colors. In the first part of the thesis, we studied the weighted version of the problem, where vertices have non-negative weights. In a weighted vertex coloring problem (WVCP) the cost of each color depends on the weights of the vertices assigned to that color and equals the maximum of these weights. Furthermore, in WVCP, the adjacent vertices are assigned different colors, and the objective is to minimize the total cost of all the colors used. We studied WVCP and proposed an O(n^2 log n) time algorithm for binary trees. Additionally, we studied WVCP in cactus paths. We proposed sub-quadratic and quadratic time algorithms for cactus paths.
We studied a min-max regret version of the robust optimization where the weight of each vertex v is in the interval [w v , w v ]. The objective of is to find a coloring that has the minimum regret value. We proposed a linear time algorithm for robust coloring on bipartite graphs with uniform upper bound and arbitrary lower bound weights on the vertices. We also gave an integer linear programming (ILP) for the robust weighted vertex coloring problem (RWVCP). We solved a relaxation of the ILP formulation using column generation. We also gave an algorithm based on the branch and price method. Lastly, we performed experiments to study the quality of our algorithms.School of graduate studies, University of Lethbridge, PIMS, NSER
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Volume 244, ESA 2022, Complete Volum
Networking - A Statistical Physics Perspective
Efficient networking has a substantial economic and societal impact in a
broad range of areas including transportation systems, wired and wireless
communications and a range of Internet applications. As transportation and
communication networks become increasingly more complex, the ever increasing
demand for congestion control, higher traffic capacity, quality of service,
robustness and reduced energy consumption require new tools and methods to meet
these conflicting requirements. The new methodology should serve for gaining
better understanding of the properties of networking systems at the macroscopic
level, as well as for the development of new principled optimization and
management algorithms at the microscopic level. Methods of statistical physics
seem best placed to provide new approaches as they have been developed
specifically to deal with non-linear large scale systems. This paper aims at
presenting an overview of tools and methods that have been developed within the
statistical physics community and that can be readily applied to address the
emerging problems in networking. These include diffusion processes, methods
from disordered systems and polymer physics, probabilistic inference, which
have direct relevance to network routing, file and frequency distribution, the
exploration of network structures and vulnerability, and various other
practical networking applications.Comment: (Review article) 71 pages, 14 figure
- …