E4 ยท Publication Volume 26

Simplification and Level of Detail

decimation error, preservation of boundaries and streaming

Learning objectives

  • Explain the decision and evidence boundary for decimation error, preservation of boundaries and streaming.
  • Select and implement the relevant representation or algorithm without hidden coordinate, support or topology assumptions.
  • Separate exact predicates, approximation error, source uncertainty and visual delivery.
  • Produce a multi-level derivative set with geometric, topological and attribute error budgets from synthetic evidence.

The lesson is complete only when the learner can defend the representation, transform, predicates, tests and release decision. A visually clean map or 3D scene without executable invariants and provenance remains unverified.

This is a general, institution-neutral tutorial with no relationship to any company or individual. All coordinates, geometries, grids, points, surfaces, volumes, attributes and review events in the lesson are synthetic and must not be used for an operational decision.

Decision context

The decision is which details may be removed for a declared task, view scale and failure consequence. Simplification is not generic compression: removing a small feature may have negligible visual effect but erase a fault offset, thin unit, narrow opening or class boundary. The contract identifies protected vertices, boundaries, intersections, components, sharp features, attribute seams and topology; defines geometric and attribute error measures; and states whether the derivative is for display, query preview or analysis. Analytical use requires its own evidence.

Write the intended use, consequence of error, required evidence, spatial support and release authority before selecting a representation or transformation. Fitness is evaluated against a versioned contract and use, not attached permanently to a file extension.

Core concept

A level-of-detail hierarchy contains derivatives with decreasing complexity and measured error. For lines and surfaces, removal candidates are evaluated against local shape, protected constraints and global error. Point-cloud levels select representative points or hierarchy nodes under a deterministic policy. Raster pyramids aggregate fixed supports. Screen-space error controls rendering but does not measure world-space scientific error. Streaming selects nodes according to view and budget; it must expose which level and source version produced the visible result.

Keep received evidence, accepted analytical views and derived representations as distinct objects. This allows corrected evidence, a changed transform or a new level of detail to generate a new result without rewriting history. Every coordinate and primitive therefore answers both a spatial question and a provenance question.

Algorithm and data model

Create an immutable base representation, a protected-feature set and a versioned simplification configuration. Each level records parent, algorithm, parameters, primitive mapping, removed and retained constraints, bounds and error statistics. Preserve identifiers where possible and provide many-to-one lineage when primitives collapse. Validate every level independently for topology, orientation, self-intersection, attribute domains and bounds. Streaming metadata contains hierarchy, refinement mode, child bounds and error so selection is reproducible rather than tied to one interface session.

Define parsing, semantic validation, canonicalisation, indexing, exact or approximate calculation, quality evaluation and encoding as separate stages. Each stage emits structured output and does not depend on interface state, file order, graphics-driver behaviour or undocumented defaults.

Constraints and invariants

| Invariant | Executable or review test | | --- | --- | | Every level of detail declares intended use and an error budget. | Reject or quarantine the exact affected object and preserve the received representation. | | Protected boundaries, features and attribute seams are explicit constraints. | Evaluate this condition before creating a derived geometry, grid, surface or volume. | | Each derivative retains primitive lineage and is validated independently. | Record the predicate, tolerance policy, observed values and coordinate frame. | | Display error never substitutes for world-space analytical error. | Make every repair a new version and rerun all dependent golden cases. |

An invariant must survive import, transformation, processing, export and rerun. A failed hard invariant produces no apparently valid substitute. Diagnostics remain visible with predicate, threshold, coordinate frame, scope and evidence, and require a reviewed rule before they can trigger repair.

Quantitative reasoning

Report primitive counts and bytes by level; maximum, mean and selected quantiles of bidirectional surface distance; boundary displacement; protected-feature displacement; attribute disagreement; component and topology changes; and measured render or transfer cost. A sampled symmetric distance is only an estimate of Hausdorff distance and must include sampling method and confidence limitations. For view selection, projected error may be derived from world error, camera distance and projection, but the stored world-space bound remains authoritative. Test flat areas, sharp ridges, thin handles, disconnected islands, holes, material seams and transformations that should leave error invariant.

Every metric includes units, support, numerator and denominator where applicable, exclusions, comparison policy and evaluation version. Aggregate metrics are stratified when pooling can hide local geometry failure. A performance gain cannot overrule invalid topology, missing reference metadata or broken lineage.

Evidence and uncertainty

Keep acquisition uncertainty, interpretation uncertainty, discretisation error, numeric round-off and delivery error separate. Increasing coordinate digits or triangle count does not improve the original evidence. A sampled surface may be smooth and watertight while remaining poorly constrained between observations. Report uncertainty in the quantity and support to which it belongs.

Build an evidence packet containing immutable received objects, semantic declarations, validation findings, transform inputs and outputs, measured errors, test results, reviewer decisions and fingerprints. Contradictory evidence remains available. When a required reference, topology state or classification cannot be resolved, return unknown, conflict or blocked rather than inventing geometry.

Interfaces and storage

Interfaces transmit identity, coordinate reference, units, axis order, support, topology expectations, attribute association, null state, version and lineage beside coordinates. Structured errors identify the object, primitive, predicate, observed value, expected condition and rule. An interface that carries vertices but drops the transform or face orientation has not preserved the object.

Store authoritative received evidence separately from reproducible analytical derivatives and disposable delivery artefacts. Indexes, caches, pyramids and render meshes improve access but cannot become the only copy of source attributes or coordinate metadata. Round-trip tests verify identity, precision, topology, ordering, missingness and association after encoding changes.

Governance and review

Assign responsibilities to roles rather than named organisations or people: evidence custodian, representation author, algorithm maintainer, independent validator and release reviewer. A role may propose a repair but cannot erase the received geometry. Transform, predicate and tolerance changes are versioned and evaluated against fixed regression fixtures before release.

Exceptions are explicit decisions with scope, rationale, evidence, approving role, affected versions and review trigger. They never turn invalid topology into valid topology by label. The host website has no ownership or scientific-authority role in this workflow; it only delivers the tutorial.

Integration checkpoint

a multi-level derivative set with geometric, topological and attribute error budgets
a multi-level derivative set with geometric, topological and attribute error budgets

Read the figure as a reasoning map from preserved evidence through declared support and coordinates, controlled transformation, validation and scoped release. Each arrow represents a declared relationship. Integrate a multi-level derivative set with geometric, topological and attribute error budgets into SYN-SPATIAL, rerun earlier fixtures and record every changed assumption.

Synthetic worked example

Synthetic surface SYN-M02 has 50,000 triangles, one narrow ridge and a small closed hole designated as protected. An unconstrained decimator reaches 2,000 triangles but removes the ridge and closes the hole while maintaining a low average vertex distance. The controlled hierarchy protects the ridge and boundary loop, reaches 2,450 triangles, and reports maximum bidirectional distance plus zero protected-feature displacement. The coarse level is approved for overview display only; section extraction continues to use the validated base surface.

  1. Preserve the received object and state the intended decision without repair.
  2. Resolve identity, reference, units, support, topology and evidence eligibility.
  3. Run the versioned transform or predicate while retaining intermediate diagnostics.
  4. Issue accept, reject or quarantine and show how an independent reviewer reproduces it.

Practice task

Implement the chapter artefact against a synthetic fixture containing one normal case, one boundary case, one invalid case and one unresolved-evidence case. Preserve the received fixture. Produce canonical input, validation findings, derivative output, processing manifest, measured error and a short release decision.

Acceptance criteria:

  • Every required identity, coordinate reference, unit, support and convention is explicit.
  • The implementation is deterministic under stable ordering and the declared numerical policy.
  • No repair overwrites received evidence or converts unknown into a guessed value.
  • All hard failures block the affected derivative and remain machine-readable.
  • A second implementation or reviewer can reproduce the result from the package alone.

Submit a multi-level derivative set with geometric, topological and attribute error budgets, golden and adversarial fixtures, exact findings, measured error and a limitations note. A screenshot is not sufficient evidence because it does not identify input versions, transforms, algorithms or rule configuration.

Common failure modes

  • Approving simplification from triangle count and average error alone.
  • Allowing a decimator to remove scientific boundaries as visual noise.
  • Running analysis on whichever level happens to be visible.
  • Streaming nodes without exposing level, error and source version.

These failures share a pattern: implicit convenience is substituted for evidence. Diagnose the earliest boundary where the assumption entered, restore the source statement, make the transform or predicate explicit, rerun all dependent derivatives and supersede rather than overwrite the affected release.

Review questions

  1. Why is simplification task dependent?
  2. Which errors can an average distance hide?
  3. What lineage is needed when many primitives collapse into one?
  4. Why must every level be validated independently?

For every answer, identify the governing invariant, evidence needed to evaluate it, numerical or semantic policy involved and correct behaviour when the condition fails.

Sources and further reading