Results 121 to 130 of about 223,659 (257)
Single Line Drawing Generation via Semantics‐Driven Optimization
Computer 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
Capturing intruders based on Voronoi diagrams assisted by information networks
International Journal of Advanced Robotic Systems, 2017 We consider a scenario of deploying multiple robots to capture all intruders in a cluttered workspace with many obstacles. Here, we say that a robot captures an intruder in the case where the intruder is within the maximum range of a weapon on the robot.
Jonghoek Kim
doaj +1 more source
Individualized Pathfinding in Rugged Open Terrains Using Semantic Navigation Meshes
Computer Graphics Forum, EarlyView.We introduce semantic navigation meshes for complex outdoor terrains, partitioning space into regions with coherent semantic properties like slope or vegetation density. The resulting graphs enable efficient pathfinding with agent‐specific, parameterized cost functions without precomputation, accelerating search while maintaining path quality close to ...
C. Creus, N. Pelechano, O. Argudo
wiley +1 more source
Phong‐Rodrigues Extrinsic Vector‐Field Processing
Computer Graphics Forum, EarlyView.Abstract We introduce a new extrinsic discretization of tangent vector fields on triangle meshes that is continuous, with bounded derivatives that are continuous almost everywhere, supporting pointwise evaluation and integration of differential operators.
Hongyi Liu +4 more
wiley +1 more source
Circles of Confidence for Multi‐Label Geometry Completion
Computer Graphics Forum, EarlyView.Abstract Inside–outside classification is widely used for geometry processing tasks such as surface reconstruction, geometry completion, and calculating signed distance fields. We introduce a new integral formulation of this problem, which assigns confidence scores that points are inside or outside, given incomplete boundary geometry.
Z. Wei +4 more
wiley +1 more source
Desenvolvimento de um sistema informatizado para determinar o espaçamento ótimo entre pontos de parada de transporte coletivo [PDF]
, 2008 Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Produção.Este trabalho tem por finalidade o desenvolvimento de uma ferramenta computacional baseada em conceitos de Diagramas de ...
Oliveira, Homero Fernandes
core
On Bending in the As‐Rigid‐As‐Possible Deformation Energy
Computer Graphics Forum, EarlyView.Abstract The well‐established As‐Rigid‐As‐Possible (ARAP) energy has various forms. For surface deformation, commonly used energies contain an implicit bending penalty. We present a natural, continuous generalization that incorporates multiple ARAP versions with an implicit, user‐controllable bending penalty.
Ugo Finnendahl, Marc Alexa
wiley +1 more source
Meshing Unsigned Distance Fields with Regular Triangulations
Computer Graphics Forum, EarlyView.Abstract Unsigned distance fields (UDF) are a versatile, implicit representation of geometry. They can represent surfaces that are not bounding a solid or contain points or curves that are not manifold, for example several sheets meeting along a common curve. Contouring the implicit representation, i.e. turning it into an explicit one, requires finding
M. Kohlbrenner, M. Alexa
wiley +1 more source
A practical algorithm for weighted k‐hulls
Computer Graphics Forum, EarlyView.Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley +1 more source
A Divide-and-Conquer Algorithm for Computing Voronoi Diagrams. [PDF]
IEEE Int Conf Electro Inf Technol, 2020 Smith E, Trefftz C, DeVries B.
europepmc +1 more source