Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 4,481 papers for “Decimation”

Decimation

Louis, chevalier de Jaucourt (biography), William Braun · The Journal of the Abraham Lincoln Association

Cited by 0

Mesh decimation.

Reposa, Jason, Garthwaite, Timothy John · Digital WPI · 2001

Rendering a three-dimensional mesh with a large number of polygons requires an immense amount of computing power. Decimation is the concept of removing a large number of those polygons from the mesh in order to lower the requirements that a computer must maintain in order to render the model. Our project is the implementation and evaluation of a computer program that uses a nontrivial Decimation algorithm to reduce the polygon count of a three dimensional mesh.

Cited by 0

etfovac/decimation: v1.0

Jovanovic, Nikola · Zenodo (CERN European Organization for Nuclear Research) · 2021

simple Decimation example

Cited by 0Open access

etfovac/decimation: v1.0

Jovanovic, Nikola · Zenodo (CERN European Organization for Nuclear Research) · 2021

simple Decimation example

Cited by 0Open access

Polygonal Models Decimation

Johannesová, Daniela · Brno University of Technology Digital Library (Brno University of Technology) · 2008

Při reprezentaci objektů pomocí polygonálních modelů často vznikají modely obsahující velmi vysoké množství polygonů. Pokud chceme pracovat s takovým modelem v reálném čase, tak je nutné ho zjednodušit.Proces zjednodušování modelu se nazývá decimace. Je známých několik decimačních metod pro zjednodušení modelů. Podle charakteristiky modelu a požadovaných vlastností zjednodušenného modelu chceme vybrat vhodnou metodu, proto je nutné znát vlastnosti jednotlivých metod a také jejich omezení.

Cited by 0

Triangle mesh decimation

Peter Polák · Digital Repository (National Repository of Grey Literature) · 2018

Modern 3D scenners produce detailed and vast scenes consisting of huge number of triangles. This thesis is dedicated to simplification of such triangu- lar meshes with attributes. The problem of reducing the number of triangles is studied as an optimization problem. Couple algorithms and approaches are introduced as solution of inner and outer optimization process. Finally, three simplification algorithms are introduced. The goal is not only to preserve the geometry of the mesh, but also its attributes such as textures and normals. Results are compared with existing solutions. The result of thesis is a complete software with graphical user interface. This software is able to load and display mesh, decimate it with user defined algorithm and parameters. Eventually, it's possible to export the scene.

Cited by 0

Deformation Sensitive Decimation

Alex Mohr, Michael Gleicher · 2003

In computer graphics, many automatic methods for simplifying polygonal meshes have been developed. These techniques work very well for static meshes; however, they do not handle the case of deforming objects. Simplifying any single pose of a deforming object may destroy detail required to represent the shape in a different pose. We present an automatic technique for simplifying deforming character meshes that takes a set of examples as input and produces a set of simplied examples as output. The method preserves detail required for deformation and maintains connectivity information across the examples. This technique is applicable to many current skinning algorithms including example-driven techniques, tting techniques and Linear Blend Skinning.

Cited by 52

MULTISTAGE DECIMATION FILTER

Gordana Jovanović Doleček, E. Erro, Vlatko Doleček · 2009

This paper presents one method for a multiplierless FIR (finite impulse response) decimation filter design. The method is based on the IFIR (interpolated finite impulse response) structure and the sharpening techniques. It is supposed that the decimation factor can be presented as the product of two factors. In that way the expanded model filter can be moved to the lower rate. The coefficients of the model filter are rounded to the nearest integers and the sharpening technique is applied to the model filter in order to improve the magnitude characteristics of the overall filter. The interpolator is the cascaded RRS (recursive running sum) filter and the simple compensator. As result the overall structure is multiplierless and exhibits a high attenuation in the stopband and a low passband droop.

Cited by 1

Optimized Multistage Decimation Based on Optimal Factorization of Decimation Ratio

Vesna Babić, Djordje Babić · IEEE Signal Processing Letters · 2025

In this paper, we analyze a method for designing an optimized multistage decimation filter chain focused on minimizing computational load. Decimation ratios for each of the K stages are determined to achieve the optimal number of filter multiplications per second. To enable the optimal factorization of non-integer or prime decimation ratios, the first stage of the decimation chain is designed to perform non-integer decimation using a transposed modified Farrow structure. We evaluate the performance of the optimized multistage filter chain with varying numbers of stages and compare it to an optimal FIR realization. The results demonstrate that the Farrow structure significantly reduces the computational load for prime and non-integer decimation cases and benefits non-prime cases.

Cited by 0

Improving alias rejection in comb decimation filters for odd decimation factors

Gordana Jovanović Doleček, Jose Carmona Suarez · 2017

This paper presents a two-stage comb decimation filter for odd decimation factors, which are factors of three. The first stage is a comb decimated by M/3, (M is the overall decimation factor), while the second stage is a comb, decimated by three. The aliasing rejection is improved by cascading a simple multiplierless filter in the second stage. As a consequence, the aliasing rejection is improved in all folding bands except for the third, sixth, ninth, etc. Mathematical background for the choice of the filter in the second stage is provided. The comb filters in both stages can be implemented either in recursive or nonrecursive forms. The comparisons with some methods, recently proposed in literature show the benefit of the proposed method.

Cited by 1

Greedy Approach Decimation Operator

Jian Sun, Edge Collapse, Edge Collapse · 2016

Quadratic Error Metric for Edge Collapse Topology Changes • Merge vertices across non-edges ◦ Change mesh topology • What about edge collapse? Topology Preserving Edge Collapse • A sufficient condition: assume M is a manifold without boundary, collapsing e does not change the topology if

Cited by 0

Structure‐Aware Mesh Decimation

David Salinas, Florent Lafarge, Pierre Alliez · Computer Graphics Forum · 2015

Abstract We present a novel approach for the decimation of triangle surface meshes. Our algorithm takes as input a triangle surface mesh and a set of planar proxies detected in a pre‐processing analysis step, and structured via an adjacency graph. It then performs greedy mesh decimation through a series of edge collapse, designed to approximate the local mesh geometry as well as the geometry and structure of proxies. Such structure‐preserving approach is well suited to planar abstraction, i.e. extreme decimation approximating well the planar parts while filtering out the others. Our experiments on a variety of inputs illustrate the potential of our approach in terms of improved accuracy and preservation of structure.

Cited by 74

Buddha - 100K Vertices Decimation

AliceVision · Zenodo (CERN European Organization for Nuclear Research) · 2019

Learn how to use open source Meshroom in this step by step tutorial on the Sketchfab Blog: https://sketchfab.com/blogs/community/tutorial-meshroom-for-beginners Low-poly version of the [default pipeline result](https://skfb.ly/6HNN9). The original model has been simplified using an automatic decimation process within Meshroom, to limit the number of vertices to a maximum of 100K. It has been cleaned up in Meshlab (bounding box cut-out) and retextured in Meshroom. **Details** - Meshroom 2019.1.0 - Input: 220 images - Camera: Sony A7S II Source: Objaverse 1.0 / Sketchfab

Cited by 0Open access