Boolean Retrieval and the Logic Model of Early Information Search
Boolean retrieval turned document searching into explicit logic: combine indexed terms with AND, OR, and NOT to define exactly which records should match.
Research-led essays, new evidence, arguments, interviews and artifact studies from a history that is still compiling. Every seeded essay ships with inline citations and a Works Cited record.
Boolean retrieval turned document searching into explicit logic: combine indexed terms with AND, OR, and NOT to define exactly which records should match.
WebGL brought a shader-based OpenGL ES graphics context into the HTML canvas, letting web pages use the GPU for interactive 3D without browser plug-ins or native installation.
Vulkan shifted work traditionally hidden inside graphics drivers into explicit application control over command buffers, memory, synchronization, queues, and pipelines, trading convenience for predictable low-overhead GPU access.
NURBS combined B-spline local control with rational weights and non-uniform knots, creating one representation that could describe both free-form industrial surfaces and exact conic geometry.
Marching Cubes converted sampled medical volumes into triangle meshes by examining each voxel cube against an isovalue. It made CT and MR data easier to see, manipulate, and render as surfaces.
James Kajiya's 1986 rendering equation expressed image synthesis as a light-transport balance between emitted and reflected radiance, giving ray tracing, radiosity, and later path-tracing methods a common theoretical framework.
Shadow mapping renders the scene from a light's viewpoint, stores the nearest depth, and compares that map during normal rendering. The simple depth-buffer idea became a foundation of real-time shadow rendering.
Lance Williams' mipmapping method prefiltered a texture into a pyramid of progressively smaller images, making texture minification faster and reducing aliasing as objects recede from the viewer.
Jim Blinn's 1978 bump-mapping method perturbed surface normals instead of adding polygons, producing convincing wrinkles and roughness while keeping the underlying geometry unchanged.
The Cohen–Sutherland algorithm used compact region codes and bit operations to avoid unnecessary intersection work, making window clipping practical for early interactive graphics and simulation.
Automotive CAD needed curves that engineers could shape interactively and manufacture precisely. Work by Paul de Casteljau at Citroën and Pierre Bézier at Renault supplied the geometric machinery.
Why3 made deductive verification modular by separating programs and specifications from the theorem provers that discharge their verification conditions, creating a reusable intermediate layer for many languages and proof engines.