Results 141 to 150 of about 634 (208)

Knotted artifacts in predicted 3D RNA structures. [PDF]

open access: yesPLoS Comput Biol
Gren BA   +4 more
europepmc   +1 more source

Almost positive links are strongly quasipositive. [PDF]

open access: yesMath Ann, 2023
Feller P, Lewark L, Lobb A.
europepmc   +1 more source

DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping

open access: yesComputer Graphics Forum, EarlyView.
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley   +1 more source

Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis

open access: yesComputer Graphics Forum, EarlyView.
Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley   +1 more source

Single Line Drawing Generation via Semantics‐Driven Optimization

open access: yesComputer Graphics Forum, EarlyView.
We present a method for automatically generating single‐line drawings in vector format, guided by a text prompt or an input image. Our approach leverages score distillation sampling to optimize the parameters of a uniform rational B‐spline (URBS) curve, ensuring that the drawing consists of a single continuous stroke by design.
Tanguy Magne   +3 more
wiley   +1 more source

Tangent Blow‐Ups for Processing Non‐Manifold Geometry

open access: yesComputer Graphics Forum, EarlyView.
Abstract Many geometry processing pipelines implicitly assume their input data is a manifold, or is sampled from one, with a unique tangent plane at every point. Geometric data, however, routinely contains sharp features like edges, corners, self‐intersections, branching junctions, and other singularities, rendering standard methods ill‐defined at ...
Alice Petrov   +3 more
wiley   +1 more source

Strictly Conservative Neural Distance Fields

open access: yesComputer Graphics Forum, EarlyView.
Abstract We propose a first method to generate neural unsigned or signed distance fields (SDFs) that are guaranteed to be conservative with respect to a given 3D shape. This means the true distance is never overestimated and the zero‐level set is a bounding volume for the shape. The method makes use of neural network architectures that ensure Lipschitz
I. Ludwig, M. Campen
wiley   +1 more source

Home - About - Disclaimer - Privacy