A penalized synthetic control estimator for disaggregated data

A Abadie, J L'hour - Journal of the American Statistical Association, 2021 - Taylor & Francis
Synthetic control methods are commonly applied in empirical research to estimate the
effects of treatments or interventions on aggregate outcomes. A synthetic control estimator …

Constrained Delaunay tetrahedral mesh generation and refinement

H Si - Finite elements in Analysis and Design, 2010 - Elsevier
A constrained Delaunay tetrahedralization of a domain in R3 is a tetrahedralization such that
it respects the boundaries of this domain, and it has properties similar to those of a Delaunay …

A progressive point cloud simplification algorithm with preserved sharp edge data

H Song, HY Feng - The International Journal of Advanced Manufacturing …, 2009 - Springer
Due to recent advances in high-speed 3D laser-scanning technologies, the set of dense
points collected from the external boundary surface of a physical object, often referred to as …

A global clustering approach to point cloud simplification with a specified data reduction ratio

H Song, HY Feng - Computer-Aided Design, 2008 - Elsevier
This paper studies the problem of point cloud simplification by searching for a subset of the
original input data set according to a specified data reduction ratio (desired number of …

Gap processing for adaptive maximal Poisson-disk sampling

DM Yan, P Wonka - ACM Transactions on Graphics (TOG), 2013 - dl.acm.org
In this article, we study the generation of maximal Poisson-disk sets with varying radii. First,
we present a geometric analysis of gaps in such disk sets. This analysis is the basis for …

Delaunay deformable models: Topology-adaptive meshes based on the restricted delaunay triangulation

JP Pons, JD Boissonnat - 2007 IEEE Conference on Computer …, 2007 - ieeexplore.ieee.org
In this paper, we propose a robust and efficient Lagrangian approach, which we call
Delaunay deformable models, for modeling moving surfaces undergoing large deformations …

[PDF][PDF] A comparison of five implementations of 3D Delaunay tessellation

Y Liu, J Snoeyink - Combinatorial and Computational Geometry, 2005 - Citeseer
When implementing Delaunay tessellation in 3D, a number of engineering decisions must
be made about update and location algorithms, arithmetics, perturbations, and …

3D boundary recovery by constrained Delaunay tetrahedralization

H Si, K Gärtner - International Journal for Numerical Methods in …, 2011 - Wiley Online Library
Three‐dimensional boundary recovery is a fundamental problem in mesh generation. In this
paper, we propose a practical algorithm for solving this problem. Our algorithm is based on …

An adaptive and rapid 3D Delaunay triangulation for randomly distributed point cloud data

T Su, W Wang, H Liu, Z Liu, X Li, Z Jia, L Zhou… - The Visual …, 2022 - Springer
Incremental algorithms are among the most popular approaches for Delaunay triangulation,
and the point insertion sequence has a substantial impact on the amount of work needed to …

High quality real-time image-to-mesh conversion for finite element simulations

P Foteinos, N Chrisochoides - Proceedings of the 27th international ACM …, 2013 - dl.acm.org
In this paper, we present a parallel Image-to-Mesh Conversion (I2M) algorithm with quality
and fidelity guarantees achieved by dynamic point insertions and removals. Starting directly …