44 research outputs found
Planar Shape Interpolation Based on Local Injective Mapping
在只给出用简单多边形表示的两输入形状的情况下,实现一种简单易用、自然高效的形状插值方法.首先利用基于形状感知的特征匹配算法生成源形状和目标形状之间的匹配;之后在源形状上构造三角剖分,并通过求解映射到目标形状上的尽量刚体的局部单射得到同构三角剖分;最后利用扭曲有界的插值方法得到中间序列.实验结果表明,该方法构造的形变结果能较好地体现源形状和目标形状的特征对应信息,形变过程自然,扭曲较小.This paper presents an efficient and easy-to-use planar shape interpolation method, given two input shapes represented by simple polygons. We firstly used a perception-based feature matching algorithm to match the feature points in the source shape with the target shape, then built compatible triangulations by constructing a locally injective mapping between the source and target shapes. Finally, an interpolation method with bounded distortion was adopted to get intermediate frames. Experimental results show that the interpolation results by our method can well reflect the feature correspondences between the source and the target shapes, and the resultant deformation is visually pleasing with less distortion.国家自然科学基金(61472332);; 中央高校基本科研业务费专项基金(20720140520
Morphing Contact Representations of Graphs
We consider the problem of morphing between contact representations of a plane graph. In a contact representation of a plane graph, vertices are realized by internally disjoint elements from a family of connected geometric objects. Two such elements touch if and only if their corresponding vertices are adjacent. These touchings also induce the same embedding as in the graph. In a morph between two contact representations we insist that at each time step (continuously throughout the morph) we have a contact representation of the same type.
We focus on the case when the geometric objects are triangles that are the lower-right half of axis-parallel rectangles. Such RT-representations exist for every plane graph and right triangles are one of the simplest families of shapes supporting this property. Thus, they provide a natural case to study regarding morphs of contact representations of plane graphs.
We study piecewise linear morphs, where each step is a linear morph moving the endpoints of each triangle at constant speed along straight-line trajectories. We provide a polynomial-time algorithm that decides whether there is a piecewise linear morph between two RT-representations of a plane triangulation, and, if so, computes a morph with a quadratic number of linear morphs. As a direct consequence, we obtain that for 4-connected plane triangulations there is a morph between every pair of RT-representations where the "top-most" triangle in both representations corresponds to the same vertex. This shows that the realization space of such RT-representations of any 4-connected plane triangulation forms a connected set
Morphing Planar Graph Drawings Optimally
We provide an algorithm for computing a planar morph between any two planar
straight-line drawings of any -vertex plane graph in morphing steps,
thus improving upon the previously best known upper bound. Further, we
prove that our algorithm is optimal, that is, we show that there exist two
planar straight-line drawings and of an -vertex plane
graph such that any planar morph between and requires
morphing steps
Optimal Morphs of Convex Drawings
We give an algorithm to compute a morph between any two convex drawings of
the same plane graph. The morph preserves the convexity of the drawing at any
time instant and moves each vertex along a piecewise linear curve with linear
complexity. The linear bound is asymptotically optimal in the worst case.Comment: To appear in SoCG 201
Morphing Schnyder drawings of planar triangulations
We consider the problem of morphing between two planar drawings of the same
triangulated graph, maintaining straight-line planarity. A paper in SODA 2013
gave a morph that consists of steps where each step is a linear morph
that moves each of the vertices in a straight line at uniform speed.
However, their method imitates edge contractions so the grid size of the
intermediate drawings is not bounded and the morphs are not good for
visualization purposes. Using Schnyder embeddings, we are able to morph in
linear morphing steps and improve the grid size to
for a significant class of drawings of triangulations, namely the class of
weighted Schnyder drawings. The morphs are visually attractive. Our method
involves implementing the basic "flip" operations of Schnyder woods as linear
morphs.Comment: 23 pages, 8 figure
3D mesh metamorphosis from spherical parameterization for conceptual design
Engineering product design is an information intensive decision-making
process that consists of several phases including design specification
definition, design concepts generation, detailed design and analysis,
and manufacturing. Usually, generating geometry models for
visualization is a big challenge for early stage conceptual design.
Complexity of existing computer aided design packages constrains
participation of people with various backgrounds in the design
process. In addition, many design processes do not take advantage of
the rich amount of legacy information available for new concepts
creation.
The research presented here explores the use of advanced graphical
techniques to quickly and efficiently merge legacy information with
new design concepts to rapidly create new conceptual product designs.
3D mesh metamorphosis framework 3DMeshMorpher was created to
construct new models by navigating in a shape-space of registered
design models. The framework is composed of: i) a fast spherical
parameterization method to map a geometric model (genus-0) onto a unit
sphere; ii) a geometric feature identification and picking technique
based on 3D skeleton extraction; and iii) a LOD controllable 3D
remeshing scheme with spherical mesh subdivision based on the
developedspherical parameterization. This efficient software framework
enables designers to create numerous geometric concepts in real time
with a simple graphical user interface.
The spherical parameterization method is focused on closed genus-zero
meshes. It is based upon barycentric coordinates with convex boundary.
Unlike most existing similar approaches which deal with each vertex in
the mesh equally, the method developed in this research focuses
primarily on resolving overlapping areas, which helps speed the
parameterization process. The algorithm starts by normalizing the
source mesh onto a unit sphere and followed by some initial relaxation
via Gauss-Seidel iterations. Due to its emphasis on solving only
challenging overlapping regions, this parameterization process is much
faster than existing spherical mapping methods.
To ensure the correspondence of features from different models, we
introduce a skeleton based feature identification and picking method
for features alignment. Unlike traditional methods that align single
point for each feature, this method can provide alignments for
complete feature areas. This could help users to create more
reasonable intermediate morphing results with preserved topological
features. This skeleton featuring framework could potentially be
extended to automatic features alignment for geometries with similar
topologies. The skeleton extracted could also be applied for other
applications such as skeleton-based animations.
The 3D remeshing algorithm with spherical mesh subdivision is
developed to generate a common connectivity for different mesh models.
This method is derived from the concept of spherical mesh subdivision.
The local recursive subdivision can be set to match the desired LOD
(level of details) for source spherical mesh. Such LOD is controllable
and this allows various outputs with different resolutions. Such
recursive subdivision then follows by a triangular correction process
which ensures valid triangulations for the remeshing. And the final
mesh merging and reconstruction process produces the remeshing model
with desired LOD specified from user. Usually the final merged model
contains all the geometric details from each model with reasonable
amount of vertices, unlike other existing methods that result in big
amount of vertices in the merged model. Such multi-resolution outputs
with controllable LOD could also be applied in various other computer
graphics applications such as computer games