20 results for “Plane primitives”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
Yuze He, Bin Tan, Zelin Gao, Yujun Shen +3 more
This paper presents PPMem, a video world model that uses plane primitives as persistent 3D memory to generate and explore environments at scale.
This paper introduces Deformable Triangle Splatting, a method for representing non-convex shapes in radiance fields using triangles with learnable control points, enabling differentiable rendering.
This paper introduces Hexels, a novel planar hexagonal surface element for efficient 3D scene and 2D image representation.
This paper proves that the minimum edge-outerplanarity of a planar graph can be computed in polynomial time.
The paper introduces a subgrid marching tetrahedra scheme that accurately recovers complex, intersection-free manifold meshes from tetrahedral grids, overcoming limitations of classic marching methods…
This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…
The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.
The paper provides a polynomial-time constant-factor approximation of the Gromov-Hausdorff distance between finite point sets in the Euclidean plane.
PlanarBench introduces a novel benchmark to test LLM spatial reasoning by requiring them to draw planar graphs as ASCII art from an edge list, finding that edge count is a stronger difficulty predicto…
This paper provides new upper bounds and algorithms for the shortest path map equivalence decomposition of a polygonal domain, leading to solutions for two-point shortest path queries, geodesic diamet…
This paper systematically explores the convex polygon reconstruction problem with specified sets of features, contributing new testing algorithms and hardness results.
The paper systematically studies the trade-offs between the number of slopes, bends per edge, and required area for planar drawings of bounded-degree graphs, providing new constructions for high-degre…
This paper shows that finding the minimum geodetic set in chordal graphs is fixed parameter tractable, implying a polynomial-time algorithm for k-trees. It also proves that the problem is NP-hard on i…
This paper presents a unified framework for floorplanning that incorporates continuously deformable rectilinear polygons into global floorplanning.
The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.
This paper experimentally evaluates various planar graph drawing algorithms and compares their performance in terms of visual properties.