AI Chat AI Image Generator AI Video Text to Speech

Unfolding Orthotrees with Constant Refinement

11/05/2018
∙
by   Mirela Damian, et al.
∙
0
∙

We show that every orthotree can be unfolded with a 4x4 refinement of the grid faces. This is the first constant refinement unfolding result for orthotrees that are not required to be well-separated.

READ FULL TEXT

Related Research

research
∙ 01/01/2022

Estimating Discretization Error with Preset Orders of Accuracy and Fractional Refinement Ratios

In solution verification, the primary goal is finding an accurate and re...
0 Sharp Chim Yui Lo, et al. ∙
research
∙ 03/06/2013

Reasoning about the Value of Decision-Model Refinement: Methods and Application

We investigate the value of extending the completeness of a decision mod...
0 Kim-Leng Poh, et al. ∙
research
∙ 05/02/2023

The Constant in the Theorem of Binev-Dahmen-DeVore-Stevenson and a Generalisation of it

A triangulation of a polytope into simplices is refined recursively. In ...
0 Lukas Gehring, et al. ∙
research
∙ 04/14/2019

A Comparison of Policy Search in Joint Space and Cartesian Space for Refinement of Skills

Imitation learning is a way to teach robots skills that are demonstrated...
0 Alexander Fabisch, et al. ∙
research
∙ 03/07/2019

Computing Three-dimensional Constrained Delaunay Refinement Using the GPU

We propose the first GPU algorithm for the 3D triangulation refinement p...
0 Zhenghai Chen, et al. ∙
research
∙ 09/16/2020

Bayesian phase estimation with adaptive grid refinement

We introduce a novel Bayesian phase estimation technique based on adapti...
0 Ramakrishna Tipireddy, et al. ∙
research
∙ 02/26/2019

Correct and Efficient Antichain Algorithms for Refinement Checking

Refinement checking plays an important role in system verification. This...
0 Maurice Laveaux, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal