Polygon soup (original) (raw)
A polygon soup is a set of unorganized polygons, typically triangles, before the application of any structuring operation, such as e.g. octree grouping. The term must not to be confused with the "PolySoup" operation available in the 3D package Houdini, whose goal is to optimize the storage space needed by some piece of geometry through the reduction of the underlying number of polygon soups used in its representation. This is accomplished by removing redundant data points (e.g. vertices with the same position) without altering the topology or assigned properties of the optimized geometry in relation to the input one. As a result of this optimization, there can be savings in the storage and processing of large polygon meshes. These savings can have a bigger impact the larger the input data
| Property | Value |
|---|---|
| dbo:abstract | A polygon soup is a set of unorganized polygons, typically triangles, before the application of any structuring operation, such as e.g. octree grouping. The term must not to be confused with the "PolySoup" operation available in the 3D package Houdini, whose goal is to optimize the storage space needed by some piece of geometry through the reduction of the underlying number of polygon soups used in its representation. This is accomplished by removing redundant data points (e.g. vertices with the same position) without altering the topology or assigned properties of the optimized geometry in relation to the input one. As a result of this optimization, there can be savings in the storage and processing of large polygon meshes. These savings can have a bigger impact the larger the input data is. For instance, fluid simulations, particle simulations, rigid-body simulations, environments, and character models can reach into the millions of polygons for feature films, incurring in large storage and read/write costs. In those cases, reducing the number of polygon soups required to represent such data can lead to important savings in storage use and compute time. (en) |
| dbo:wikiPageID | 28183104 (xsd:integer) |
| dbo:wikiPageLength | 1813 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 853571813 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Houdini_(software) dbc:Computer_graphics_data_structures dbc:3D_computer_graphics dbr:Octree |
| dbp:date | August 2018 (en) |
| dbp:wikiPageUsesTemplate | dbt:Explain dbt:Geometry-stub dbt:More_citations_needed dbt:Reflist dbt:Computer-graphics-stub |
| dcterms:subject | dbc:Computer_graphics_data_structures dbc:3D_computer_graphics |
| gold:hypernym | dbr:Group |
| rdf:type | yago:WikicatComputerGraphicsDataStructures yago:Abstraction100002137 yago:Arrangement105726596 yago:Cognition100023271 yago:DataStructure105728493 yago:PsychologicalFeature100023100 dbo:Band yago:Structure105726345 |
| rdfs:comment | A polygon soup is a set of unorganized polygons, typically triangles, before the application of any structuring operation, such as e.g. octree grouping. The term must not to be confused with the "PolySoup" operation available in the 3D package Houdini, whose goal is to optimize the storage space needed by some piece of geometry through the reduction of the underlying number of polygon soups used in its representation. This is accomplished by removing redundant data points (e.g. vertices with the same position) without altering the topology or assigned properties of the optimized geometry in relation to the input one. As a result of this optimization, there can be savings in the storage and processing of large polygon meshes. These savings can have a bigger impact the larger the input data (en) |
| rdfs:label | Polygon soup (en) |
| owl:sameAs | freebase:Polygon soup yago-res:Polygon soup wikidata:Polygon soup https://global.dbpedia.org/id/4tMAE |
| prov:wasDerivedFrom | wikipedia-en:Polygon_soup?oldid=853571813&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Polygon_soup |
| is dbo:wikiPageWikiLink of | dbr:List_of_game_engines dbr:Cube_2:_Sauerbraten dbr:Polygon |
| is foaf:primaryTopic of | wikipedia-en:Polygon_soup |