Cover Image

Polynomial 2D Green Coordinates for High-order Cages

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Shibo, Liu, Ligang, Fu, Xiao-Ming
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polynomial 2D Biharmonic Coordinates for High-order Cages
by: Liu, Shibo, et al.
Published: (2025)

Outer Contour-driven Ruled Surface Generation for Linear Hot-wire Rough Machining
by: Zhang, Zheng, et al.
Published: (2025)

MASH: Masked Anchored SpHerical Distances for 3D Shape Representation and Generation
by: Li, Changhao, et al.
Published: (2025)

A Polynomial-Time Algorithm for Computing the Exact Convex Hull in High-Dimensional Spaces
by: Zhuang, Qianwei
Published: (2025)

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
by: Vu, Thi Xuan
Published: (2025)

The Contiguous Art Gallery Problem is Solvable in Polynomial Time
by: Merrild, Magnus Christian Ring, et al.
Published: (2024)

Minimum Star Partitions of Simple Polygons in Polynomial Time
by: Abrahamsen, Mikkel, et al.
Published: (2023)

How Many Slopes Does Polynomial Area Cost?
by: Bekos, Michael A., et al.
Published: (2026)

2-Layer Fan-Planarity in Polynomial Time
by: Kobayashi, Yasuaki, et al.
Published: (2025)

Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications
by: Aronov, Boris, et al.
Published: (2019)

Counting Number of Triangulations of Point Sets: Reinterpreting and Generalizing the Triangulation Polynomials
by: Bui, Hong Duc
Published: (2025)

The Proper Basis for Polynomial Ideals
by: Ma, Sheng-Ming
Published: (2021)

Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity
by: Davies, James, et al.
Published: (2024)

Minimum-Length Coordinated Motions For Two Convex Centrally-Symmetric Robots
by: Kirkpatrick, David, et al.
Published: (2025)

Metric Optimization in Penner Coordinates
by: Capouellez, Ryan, et al.
Published: (2022)

Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
by: Gibor, Daniel
Published: (2025)

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
by: Zhou, Yi, et al.
Published: (2026)

Persistent components in Canny's Generalized Characteristic Polynomial
by: Pogudin, Gleb
Published: (2024)

Initial Placement for Fruchterman--Reingold Force Model With Coordinate Newton Direction
by: Hamaguchi, Hiroki, et al.
Published: (2024)

A New Geometric Representation for 3D Bijective Mappings and Applications
by: Chen, Qiguang, et al.
Published: (2023)

Tractability Frontiers in Multi-Robot Coordination and Geometric Reconfiguration
by: Geft, Tzvika, et al.
Published: (2021)

Neural Slicer for Multi-Axis 3D Printing
by: Liu, Tao, et al.
Published: (2024)

Sibson's formula for higher order Voronoi diagrams
by: Claverol, Mercè, et al.
Published: (2024)

Polynomial Inscriptions
by: Greene, Joshua Evan, et al.
Published: (2024)

Optimistic Imprecise Shortest Watchtower in 1.5D and 2.5D
by: McCoy, Bradley, et al.
Published: (2026)

Sparse Tensors and Subdivision Methods for Finding the Zero Set of Polynomial Equations
by: Moroz, Guillaume
Published: (2024)

Eigenvalue Blending for Projected Newton
by: Yuan‐Yuan Cheng, et al.
Published: (2025)

Finite Automata Encoding Piecewise Polynomials
by: Berdinsky, Dmitry, et al.
Published: (2021)

Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid
by: Förster, Henry, et al.
Published: (2025)

Dimension Results for Extremal-Generic Polynomial Systems over Complete Toric Varieties
by: Bender, Matías, et al.
Published: (2023)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
by: Eppstein, David
Published: (2023)

Filling holes in LoD2 building models
by: Gao, Weixiao, et al.
Published: (2024)

Algebraic Tools for Computing Polynomial Loop Invariants
by: Bayarmagnai, Erdenebayar, et al.
Published: (2024)

An open-source heuristic to reboot 2D nesting research
by: Gardeyn, Jeroen, et al.
Published: (2025)

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
by: S, Ajaykrishnan E, et al.
Published: (2025)

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
by: Khanna, Sanjeev, et al.
Published: (2025)

Complexity of 2D Snake Cube Puzzles
by: MIT Hardness Group, et al.
Published: (2024)

Fast Fiber Line Extraction for 2D Bivariate Scalar Fields
by: Raith, Felix, et al.
Published: (2023)

Algebraic and Algorithmic Methods for Computing Polynomial Loop Invariants
by: Bayarmagnai, Erdenebayar, et al.
Published: (2024)

Designing 3D Anisotropic Frame Fields with Odeco Tensors
by: Zhu, Haikuan, et al.
Published: (2025)