4.4 Article Proceedings Paper

Subdividing barycentric coordinates

期刊

COMPUTER AIDED GEOMETRIC DESIGN
卷 43, 期 -, 页码 172-185

出版社

ELSEVIER
DOI: 10.1016/j.cagd.2016.02.005

关键词

Barycentric coordinates; Subdivision

向作者/读者索取更多资源

Barycentric coordinates are commonly used to represent a point inside a polygon as an affine combination of the polygon's vertices and to interpolate data given at these vertices. While unique for triangles, various generalizations to arbitrary simple polygons exist, each satisfying a different set of properties. Some of these generalized barycentric coordinates do not have a closed form and can only be approximated by piecewise linear functions. In this paper we show that subdivision can be used to refine these piecewise linear functions without losing the key barycentric properties. For a wide range of subdivision schemes, this generates a sequence of piecewise linear coordinates which converges to non-negative and C-1 continuous coordinates in the limit. The power of the described approach comes from the possibility of evaluating the C-1 limit coordinates and their derivatives directly. We support our theoretical results with several examples, where we use Loop or Catmull-Clark subdivision to generate C-1 coordinates, which inherit the favourable shape properties of harmonic coordinates or the small support of local barycentric coordinates. (C) 2016 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Mathematics, Applied

On the Lebesgue constant of barycentric rational Hermite interpolants at equidistant nodes

Emiliano Cirillo, Kai Hormann

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2019)

Article Mathematics, Applied

Repeated local operations and associated interpolation properties of dual 2n-point subdivision schemes

Chongyang Deng, Huixia Xu, Weiyin Ma, Yajuan Li

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2019)

Article Mathematics, Applied

Behaviour of exponential three-point coordinates at the vertices of convex polygons

Dmitry Anisimov, Kai Hormann, Teseo Schneider

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2019)

Article Mathematics, Applied

Convergence rates of a Hermite generalization of Floater-Hormann interpolants

Emiliano Cirillo, Kai Hormann, Jean Sidon

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2020)

Article Computer Science, Software Engineering

Algebraic and geometric characterizations of a class of planar quartic curves with rational offsets

Kai Hormann, Jianmin Zheng

COMPUTER AIDED GEOMETRIC DESIGN (2020)

Article Computer Science, Software Engineering

Iterative coordinates

Chongyang Deng, Qingjun Chang, Kai Hormann

COMPUTER AIDED GEOMETRIC DESIGN (2020)

Article Computer Science, Software Engineering

Interpolatory Catmull-Clark volumetric subdivision over unstructured hexahedral meshes for modeling and simulation applications

Jin Xie, Jinlan Xu, Zhenyu Dong, Gang Xu, Chongyang Deng, Bernard Mourrain, Yongjie Jessica Zhang

COMPUTER AIDED GEOMETRIC DESIGN (2020)

Article Computer Science, Software Engineering

Singular cases of planar and spatial C-1 Hermite interpolation problems based on quintic Pythagorean-hodograph curves

Rida T. Farouki, Kai Hormann, Federico Nudo

COMPUTER AIDED GEOMETRIC DESIGN (2020)

Article Computer Science, Software Engineering

On Landmark Distances in Polygons

C. Gotsman, K. Hormann

Summary: The study focuses on the landmark distance function in a simply connected planar polygon, demonstrating the effectiveness of steepest descent in generating paths between any two points in the polygon without getting stuck.

COMPUTER GRAPHICS FORUM (2021)

Article Computer Science, Software Engineering

Non-uniform interpolatory subdivision schemes with improved smoothness

Nira Dyn, Kai Hormann, Claudio Mancinelli

Summary: This paper explores subdivision schemes, focusing on univariate, linear, binary schemes, as well as deriving and applying properties of non-stationary and non-uniform schemes.

COMPUTER AIDED GEOMETRIC DESIGN (2022)

Article Computer Science, Software Engineering

P-spline curves

Zhihao Wang, Yajuan Li, Huixia Xu, Jianzhen Liu, Chongyang Deng

Summary: This paper introduces a new parametric spline curve, called P-spline curve, and discusses its definition and construction. P-spline curves have the advantages of adjustable continuous orders and local influences, as well as simple construction and intuitive relations.

VISUAL COMPUTER (2023)

Article Computer Science, Software Engineering

Blending Bezier patch for multi-sided surface modeling

Kaikai Qin, Yajuan Li, Chongyang Deng

Summary: This study introduces a new n-sided control point-based surface patch called the blending Bezier patch (BB patch). It is constructed by creating corner Bezier surfaces and using Gregory corner blending. The BB patch is defined on a regular polygonal domain and can be joined easily to surrounding Bezier and other BB patches due to its similarity in boundary behaviors with the Bezier patch. A practical application of the BB patch is filling holes with G2 continuity.

COMPUTER AIDED GEOMETRIC DESIGN (2023)

Article Computer Science, Software Engineering

Constrained least square progressive and iterative approximation (CLSPIA) for B-spline curve and surface fitting

Qingjun Chang, Weiyin Ma, Chongyang Deng

Summary: In this paper, we propose a constrained least square progressive and iterative approximation (CLSPIA) method to solve the problem of B-spline curve and surface fitting with constraint on data interpolation. The CLSPIA method inherits all the nice properties of LSPIA, and it is efficient and effective.

VISUAL COMPUTER (2023)

Proceedings Paper Computer Science, Artificial Intelligence

Compressing Geodesic Information for Fast Point-to-Point Geodesic Distance Queries

Craig Gotsman, Kai Hormann

Summary: The paper proposes a novel method for compact storage of geodesic distance information and efficient point-to-point geodesic distance queries. It achieves this through a nested bisection of the mesh surface and compactly describing distances between mesh vertices and relevant subset of curves. The method provides a good tradeoff between database size, query runtime, and result accuracy.

PROCEEDINGS SIGGRAPH ASIA 2022 (2022)

暂无数据