Results 241 to 250 of about 723,861 (287)
Synergistic Graphene Polishing Enabling van der Waals Anchors for Efficient and Robust Carbon-Based Perovskite Solar Cells. [PDF]
Khawaja KA +6 more
europepmc +1 more source
Extended fractional Hofstadter states at high field in twisted bilayer graphene above the magic angle. [PDF]
Finney J +9 more
europepmc +1 more source
Hole Filling in 3D Volumetric Objects
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Laurent Babout +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Robust Hole-Filling Algorithm for Triangular Mesh
Visual Computer, 2007Summary form only given. This paper presents a novel hole-filling algorithm that can fill arbitrary holes in triangular mesh models. First, the advancing front mesh technique is used to cover the hole with newly created triangles. Next, the desirable normals of the new triangles are approximated using our desirable normal computing schemes.
Shuming Gao, Hongwei Lin
exaly +2 more sources
Effects of Organic Acids on Through-Hole Filling by Copper Electroplating
Through-hole (TH) filling of a printed circuit board (PCB) by copper electroplating was performed usingformic acid, acetic acid and propionic acid instead of H2SO4.
Wei-Ping Dow, Chun-Wei Lu, Jhih-Jyun Yan
exaly +2 more sources
Filling time by plugging the holes
ACM SIGGRAPH 2007 posters, 2007We explore a new technique for video frame rate up-conversion (FRUC). A noniterative multilayer motion estimation algorithm is investigated, based on spatio-temporal smoothness constraints. Our algorithm's performance is at par with complicated iterative algorithms based on motion segmentation.
Vikas Ramachandra +2 more
openaire +1 more source
2003
Laser scans of real objects produce data sets (point clouds) which may have holes, due to problems with visibility or with the optical properties of the surface. We describe a method for detecting and filling these holes. After detecting the boundary of the hole, we fit an algebraic surface patch to the neighbourhood and sample auxiliary points.
Pavel Chalmovianský, Bert Jüttler
openaire +2 more sources
Laser scans of real objects produce data sets (point clouds) which may have holes, due to problems with visibility or with the optical properties of the surface. We describe a method for detecting and filling these holes. After detecting the boundary of the hole, we fit an algebraic surface patch to the neighbourhood and sample auxiliary points.
Pavel Chalmovianský, Bert Jüttler
openaire +2 more sources
Filling holes with shape preserving conditions
Mathematics and Computers in Simulation, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miguel A. Fortes +3 more
openaire +1 more source
1993
Smooth surface patches, such as Gregory patch, Brown’s square and Nielson- Foley patch, which interpolate a given function and its derivatives on the boundary of a rectangle or a triangle, with incompatible twist terms, have been constructed with rational parametric representation by using boolean sum techniques, convex combination methods and ...
openaire +2 more sources
Smooth surface patches, such as Gregory patch, Brown’s square and Nielson- Foley patch, which interpolate a given function and its derivatives on the boundary of a rectangle or a triangle, with incompatible twist terms, have been constructed with rational parametric representation by using boolean sum techniques, convex combination methods and ...
openaire +2 more sources

