18 papers · ranked by Valyu relevance
Erdem, Burak Nur, Ekim, Tınaz + 2 more
Graph modification problems, which aim to find a small set of modifications to a graph so that it satisfies a desired property, have been studied for several special graph classes. The literature is rather rich in NP-completeness results and polynomial time solvable cases. However, to the best of our knowledge, only a…
Alessio Romanelli, Michaela Servi, Francesco Buonamici, Yary Volpe
In bone tumor resection surgery, patient-specific cutting guides aid the surgeon in the resection of a precise part of the bone. Despite the use of automation methodologies in surgical guide modeling, to date, the placement of cutting planes is a manual task. This work presents an algorithm for the automatic…
Qiqin Zhan, Xiaojun Chen, Qinghui Zhang
This paper proposes an interactive method of model clipping for computer-assisted surgical planning. The model is separated by a data filter that is defined by the implicit function of the clipping path. Being interactive to surgeons, the clipping path that is composed of the plane widgets can be manually repositioned…
Qiangqiang Cheng, Peter X. Liu, Pinhua Lai, Shaoping Xu + 1 more
In the present work, the majority of implemented virtual surgery simulation systems have been based on either a mesh or meshless strategy with regard to soft tissue modelling. To take full advantage of the mesh and meshless models, a novel coupled soft tissue cutting model is proposed. Specifically, the reconstructed…
Minyue Li, Wensong Jiang, Zai Luo, Yan Wang + 1 more
Path planning is crucial for automatic measurement to ensure a collision-free process for manipulators. However, the more complex the measurement environment, the more complex the path planning scheme is often required in order to meet the above requirements. To overcome this problem, a planar constraint RRT method…
Amr Elmasry, Frank Kammer
We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of n items and that the available workspace is Θ(s) bits, where lg n ≤ s ≤ n · lg n. Three techniques that can be used as general tools in different space-efficient algorithms…
Christine Dahn, Nils M. Kriege, Petra Mutzel
We propose a fixed-parameter tractable algorithm for the Max-Cut problem on embedded 1-planar graphs parameterized by the crossing number k of the given embedding. A graph is called 1-planar if it can be drawn in the plane with at most one crossing per edge. Our algorithm recursively reduces a 1-planar graph to at most…
Marcelo Cicconet, Daniel R. Hochbaum
Immunostaining of brain slices is a ubiquitous technique used throughout neuroscience for the purposes of understanding the anatomical and molecular characteristics of brain circuits. Yet the variety of distortions introduced, and the manual nature of the preparation, hinder the use of the generated images from being…
Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling
We propose two fixed-parameter tractable algorithms for the weighted Max-Cut problem on embedded 1-planar graphs parameterized by the crossing number k of the given embedding. A graph is called 1-planar if it can be drawn in the plane with at most one crossing per edge. Our algorithms recursively reduce a 1-planar…
Authors not listed
The global drive towards net-zero has accelerated the adoption of carbon fibre reinforced polymers (CFRP) for lightweight structures in various sectors such as aerospace, automotive, energy and biomedical. Mechanical machining of CFRP is often necessary to meet dimensional or assembly-related requirements. However…
Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen
'Christian Wulff-Nilsen'] For an undirected n-vertex graph G with non-negative edge-weights, we consider the following type of query: given two vertices s and t in G, what is the weight of a minimum st-cut in G? We solve this problem in preprocessing time O(nlog3 n) for graphs of bounded genus, giving the first…
Martí Verdaguer Mallorquí, Julian F.V. Vincent, Andrew Liston, Vladimir Blagoderov + 1 more
Sawflies (Insecta: Symphyta) use their ovipositors to incise plant tissue and deposit eggs, a task that demands precise substrate discrimination while preserving both ovipositor and host. How a passive selective mechanical system such as the ovipositor can discriminate between substrates based on material properties…
Ngoc Tam Lam, Ian Howard, Lei Cui, Marco Livesu
The five Platonic solids-tetrahedron, cube, octahedron, dodecahedron, and icosahedron-have found many applications in mathematics, science, and art. Path planning for the Platonic solids had been suggested, but not validated, except for solving the rolling-cube puzzles for a cubic dice. We developed a path-planning…
Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
'Siddharth Gupta'] Abstract. The C-Planarity problem asks for a drawing of a clustered graph, i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by a simple closed region with no edgeedge crossings, no region-region crossings, and no unnecessary edge-region crossings.…
Authors not listed
Genetic Algorithms are a powerful method to solve optimization problems with complex cost functions over vast search spaces that rely in particular on recombining parts of previous solutions. Crossover operators play a crucial role in this context. Here, we describe a large class of these operators designed for…
Jing Xie, Qi Duan
Biological pathway analysis often requires identifying interventions that block reachability to an undesirable state, such as a disease-associated module, toxic byproduct, or adverse phenotype, while preserving reachability among essential biological functions. Motivated by this setting, we study the Reachability…
Thomas Lynn, Julio Ottino, Richard Lueptow, Paul Umbanhowar
Cut-and-shuffle mixing is an instructive candidate system with which to assess the potential of machine learning (ML) as an approach to solve difficult mixing problems. We focus on a specific subset of cut-and-shuffle systems, the one-dimensional interval exchange transform. This class of mixing operations is well…
Susumu Kawakami
I propose a series of modeled cells for detecting three plane parameters (i.e. a time-to-contact to a plane, its orientation, and its shortest distance) with motion stereo. This series is composed of lateral geniculate nucleus cells, nondirectionally selective simple cells, directionally selective (DS) simple cells, DS…